./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:32:05,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:05,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:32:05,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:05,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:05,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:05,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:05,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:05,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:05,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:05,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:05,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:05,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:05,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:05,659 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:05,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:05,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:05,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:05,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:05,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:05,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:05,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:05,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:05,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:05,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:05,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:05,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:05,663 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 [2025-03-08 05:32:05,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:05,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:05,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:05,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:05,921 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:05,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2025-03-08 05:32:07,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ad7c747/67c05e4107f94cfd8266b831ab6763cf/FLAG89c499bd5 [2025-03-08 05:32:07,405 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:07,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2025-03-08 05:32:07,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ad7c747/67c05e4107f94cfd8266b831ab6763cf/FLAG89c499bd5 [2025-03-08 05:32:07,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ad7c747/67c05e4107f94cfd8266b831ab6763cf [2025-03-08 05:32:07,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:07,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:07,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:07,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:07,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:07,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:07" (1/1) ... [2025-03-08 05:32:07,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:07, skipping insertion in model container [2025-03-08 05:32:07,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:07" (1/1) ... [2025-03-08 05:32:07,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:07,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2025-03-08 05:32:07,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:07,898 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:07,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:32:07,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [414] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [461] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [499] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [799] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [808] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1024] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1129] [2025-03-08 05:32:07,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1146] [2025-03-08 05:32:07,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2217] [2025-03-08 05:32:07,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2621] [2025-03-08 05:32:07,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2025-03-08 05:32:08,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:08,023 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:08,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08 WrapperNode [2025-03-08 05:32:08,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:08,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:08,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:08,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:08,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,086 INFO L138 Inliner]: procedures = 127, calls = 186, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 956 [2025-03-08 05:32:08,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:08,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:08,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:08,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:08,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,113 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:32:08,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:08,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:08,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:08,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:08,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (1/1) ... [2025-03-08 05:32:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:08,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:32:08,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:32:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:08,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:08,201 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:08,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:08,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:08,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:08,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:08,396 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: #res := ~retValue_acc~36; [2025-03-08 05:32:08,607 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265-1: getEmailId_#res#1 := getEmailId_~retValue_acc~28#1; [2025-03-08 05:32:08,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-08 05:32:08,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-03-08 05:32:08,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2025-03-08 05:32:08,608 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1759-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~19#1; [2025-03-08 05:32:08,615 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: #res := ~retValue_acc~35; [2025-03-08 05:32:08,638 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: #res := ~retValue_acc~37; [2025-03-08 05:32:08,649 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2339: #res := ~retValue_acc~30; [2025-03-08 05:32:08,674 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1851: #res#1 := ~retValue_acc~21#1; [2025-03-08 05:32:08,674 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-03-08 05:32:08,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: #res := ~retValue_acc~24; [2025-03-08 05:32:08,717 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1126-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-03-08 05:32:08,929 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-08 05:32:08,929 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-08 05:32:08,929 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-08 05:32:08,929 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-03-08 05:32:08,930 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-03-08 05:32:08,930 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L496-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-08 05:32:08,937 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2302: #res := ~retValue_acc~29; [2025-03-08 05:32:08,939 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1102: #res := ~retValue_acc~6; [2025-03-08 05:32:09,048 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:09,048 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:09,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:09,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:09,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:09 BoogieIcfgContainer [2025-03-08 05:32:09,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:09,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:09,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:09,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:09,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:07" (1/3) ... [2025-03-08 05:32:09,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bc1007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:09, skipping insertion in model container [2025-03-08 05:32:09,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:08" (2/3) ... [2025-03-08 05:32:09,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bc1007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:09, skipping insertion in model container [2025-03-08 05:32:09,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:09" (3/3) ... [2025-03-08 05:32:09,074 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product19.cil.c [2025-03-08 05:32:09,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:09,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product19.cil.c that has 19 procedures, 312 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:09,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:09,151 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b23f10e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:09,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 246 states have (on average 1.524390243902439) internal successors, (375), 248 states have internal predecessors, (375), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:32:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:32:09,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:09,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:09,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:09,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash 603025743, now seen corresponding path program 1 times [2025-03-08 05:32:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:09,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255478032] [2025-03-08 05:32:09,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:09,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:09,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:32:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255478032] [2025-03-08 05:32:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255478032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355533174] [2025-03-08 05:32:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:09,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:09,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:09,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:09,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:32:09,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:32:10,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:32:10,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:10,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:10,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355533174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508474872] [2025-03-08 05:32:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:10,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:10,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:10,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:10,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:10,122 INFO L87 Difference]: Start difference. First operand has 312 states, 246 states have (on average 1.524390243902439) internal successors, (375), 248 states have internal predecessors, (375), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:10,181 INFO L93 Difference]: Finished difference Result 473 states and 694 transitions. [2025-03-08 05:32:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-08 05:32:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:10,193 INFO L225 Difference]: With dead ends: 473 [2025-03-08 05:32:10,194 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 05:32:10,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:10,200 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:10,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 923 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 05:32:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-08 05:32:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 242 states have internal predecessors, (366), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 05:32:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 457 transitions. [2025-03-08 05:32:10,249 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 457 transitions. Word has length 108 [2025-03-08 05:32:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:10,250 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 457 transitions. [2025-03-08 05:32:10,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 457 transitions. [2025-03-08 05:32:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:32:10,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:10,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:10,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:32:10,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1419505047, now seen corresponding path program 1 times [2025-03-08 05:32:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256984410] [2025-03-08 05:32:10,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:10,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:32:10,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:32:10,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:10,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:10,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256984410] [2025-03-08 05:32:10,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256984410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597931904] [2025-03-08 05:32:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:10,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:10,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:32:10,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:32:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:32:10,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:10,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:10,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:32:10,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597931904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384973736] [2025-03-08 05:32:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:10,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:10,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:10,983 INFO L87 Difference]: Start difference. First operand 306 states and 457 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,018 INFO L93 Difference]: Finished difference Result 641 states and 972 transitions. [2025-03-08 05:32:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-08 05:32:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,022 INFO L225 Difference]: With dead ends: 641 [2025-03-08 05:32:11,022 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 05:32:11,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:11,026 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 107 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:11,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 880 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 05:32:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2025-03-08 05:32:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 277 states have (on average 1.5379061371841156) internal successors, (426), 278 states have internal predecessors, (426), 57 states have call successors, (57), 18 states have call predecessors, (57), 18 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 05:32:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2025-03-08 05:32:11,049 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 112 [2025-03-08 05:32:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,050 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2025-03-08 05:32:11,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2025-03-08 05:32:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:32:11,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:11,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:32:11,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:32:11,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:11,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1805624497, now seen corresponding path program 1 times [2025-03-08 05:32:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813620725] [2025-03-08 05:32:11,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:11,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:32:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:32:11,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:11,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813620725] [2025-03-08 05:32:11,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813620725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555632774] [2025-03-08 05:32:11,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:11,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:11,443 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:11,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:32:11,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:32:11,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:32:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:11,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:11,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:11,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:11,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555632774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:11,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:11,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:11,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86521293] [2025-03-08 05:32:11,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:11,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:11,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:11,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:11,735 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:11,793 INFO L93 Difference]: Finished difference Result 697 states and 1068 transitions. [2025-03-08 05:32:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:11,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2025-03-08 05:32:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:11,798 INFO L225 Difference]: With dead ends: 697 [2025-03-08 05:32:11,798 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 05:32:11,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:11,799 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:11,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1781 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 05:32:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-08 05:32:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 278 states have (on average 1.5359712230215827) internal successors, (427), 280 states have internal predecessors, (427), 57 states have call successors, (57), 18 states have call predecessors, (57), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2025-03-08 05:32:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2025-03-08 05:32:11,814 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 113 [2025-03-08 05:32:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:11,815 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2025-03-08 05:32:11,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2025-03-08 05:32:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:32:11,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:11,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:11,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:12,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:12,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:12,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1358835702, now seen corresponding path program 1 times [2025-03-08 05:32:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989335774] [2025-03-08 05:32:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:32:12,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:32:12,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989335774] [2025-03-08 05:32:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989335774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813094798] [2025-03-08 05:32:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:12,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:12,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:32:12,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:32:12,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:32:12,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:12,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:32:12,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:12,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813094798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:12,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:12,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456973620] [2025-03-08 05:32:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:12,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:12,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:12,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:12,468 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:12,546 INFO L93 Difference]: Finished difference Result 699 states and 1073 transitions. [2025-03-08 05:32:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-03-08 05:32:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:12,550 INFO L225 Difference]: With dead ends: 699 [2025-03-08 05:32:12,550 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 05:32:12,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:12,551 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 2 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:12,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1767 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 05:32:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-08 05:32:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 279 states have (on average 1.5340501792114696) internal successors, (428), 282 states have internal predecessors, (428), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-08 05:32:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-03-08 05:32:12,577 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 114 [2025-03-08 05:32:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:12,578 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-03-08 05:32:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-03-08 05:32:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:32:12,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:12,583 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:12,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:12,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:12,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:12,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash -927597160, now seen corresponding path program 1 times [2025-03-08 05:32:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:12,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322658471] [2025-03-08 05:32:12,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:12,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:32:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:32:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322658471] [2025-03-08 05:32:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322658471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617443432] [2025-03-08 05:32:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:12,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:12,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:12,932 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:12,971 INFO L93 Difference]: Finished difference Result 691 states and 1064 transitions. [2025-03-08 05:32:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-08 05:32:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:12,974 INFO L225 Difference]: With dead ends: 691 [2025-03-08 05:32:12,974 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 05:32:12,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:12,977 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:12,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1785 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 05:32:12,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-08 05:32:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 279 states have (on average 1.5340501792114696) internal successors, (428), 282 states have internal predecessors, (428), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-08 05:32:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 547 transitions. [2025-03-08 05:32:12,997 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 547 transitions. Word has length 115 [2025-03-08 05:32:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:12,997 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 547 transitions. [2025-03-08 05:32:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:32:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 547 transitions. [2025-03-08 05:32:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:32:12,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:13,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1725528109, now seen corresponding path program 2 times [2025-03-08 05:32:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903087282] [2025-03-08 05:32:13,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-08 05:32:13,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 116 statements. [2025-03-08 05:32:13,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:13,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903087282] [2025-03-08 05:32:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903087282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439100037] [2025-03-08 05:32:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:13,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:13,099 INFO L87 Difference]: Start difference. First operand 357 states and 547 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,121 INFO L93 Difference]: Finished difference Result 503 states and 750 transitions. [2025-03-08 05:32:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-03-08 05:32:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,126 INFO L225 Difference]: With dead ends: 503 [2025-03-08 05:32:13,126 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 05:32:13,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:13,127 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:13,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1805 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 05:32:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-08 05:32:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 282 states have internal predecessors, (427), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-08 05:32:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 546 transitions. [2025-03-08 05:32:13,146 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 546 transitions. Word has length 116 [2025-03-08 05:32:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,147 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 546 transitions. [2025-03-08 05:32:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:32:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 546 transitions. [2025-03-08 05:32:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:32:13,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:13,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 616592149, now seen corresponding path program 1 times [2025-03-08 05:32:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920873851] [2025-03-08 05:32:13,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:32:13,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:32:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:13,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920873851] [2025-03-08 05:32:13,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920873851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585543667] [2025-03-08 05:32:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:13,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:13,273 INFO L87 Difference]: Start difference. First operand 357 states and 546 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,313 INFO L93 Difference]: Finished difference Result 693 states and 1065 transitions. [2025-03-08 05:32:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-03-08 05:32:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,316 INFO L225 Difference]: With dead ends: 693 [2025-03-08 05:32:13,316 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 05:32:13,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:13,321 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:13,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1784 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 05:32:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-08 05:32:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 280 states have (on average 1.5285714285714285) internal successors, (428), 284 states have internal predecessors, (428), 57 states have call successors, (57), 18 states have call predecessors, (57), 21 states have return successors, (64), 56 states have call predecessors, (64), 56 states have call successors, (64) [2025-03-08 05:32:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 549 transitions. [2025-03-08 05:32:13,341 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 549 transitions. Word has length 123 [2025-03-08 05:32:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,342 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 549 transitions. [2025-03-08 05:32:13,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:32:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 549 transitions. [2025-03-08 05:32:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:32:13,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:13,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 622337837, now seen corresponding path program 1 times [2025-03-08 05:32:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014657024] [2025-03-08 05:32:13,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:32:13,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:32:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:32:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014657024] [2025-03-08 05:32:13,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014657024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649274421] [2025-03-08 05:32:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:13,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:13,477 INFO L87 Difference]: Start difference. First operand 359 states and 549 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,590 INFO L93 Difference]: Finished difference Result 695 states and 1064 transitions. [2025-03-08 05:32:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:13,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 124 [2025-03-08 05:32:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,594 INFO L225 Difference]: With dead ends: 695 [2025-03-08 05:32:13,594 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 05:32:13,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:13,595 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 7 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:13,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3044 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 05:32:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-08 05:32:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 282 states have (on average 1.524822695035461) internal successors, (430), 285 states have internal predecessors, (430), 57 states have call successors, (57), 19 states have call predecessors, (57), 21 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-08 05:32:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 550 transitions. [2025-03-08 05:32:13,615 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 550 transitions. Word has length 124 [2025-03-08 05:32:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,616 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 550 transitions. [2025-03-08 05:32:13,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 550 transitions. [2025-03-08 05:32:13,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:32:13,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:13,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1828240051, now seen corresponding path program 2 times [2025-03-08 05:32:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666186908] [2025-03-08 05:32:13,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-08 05:32:13,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:32:13,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:32:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:32:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666186908] [2025-03-08 05:32:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666186908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:32:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711830537] [2025-03-08 05:32:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:13,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:13,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:13,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:13,759 INFO L87 Difference]: Start difference. First operand 361 states and 550 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:13,819 INFO L93 Difference]: Finished difference Result 695 states and 1068 transitions. [2025-03-08 05:32:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 125 [2025-03-08 05:32:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:13,821 INFO L225 Difference]: With dead ends: 695 [2025-03-08 05:32:13,822 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 05:32:13,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:13,823 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:13,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2212 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 05:32:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-08 05:32:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 283 states have (on average 1.5229681978798586) internal successors, (431), 287 states have internal predecessors, (431), 57 states have call successors, (57), 19 states have call predecessors, (57), 22 states have return successors, (68), 56 states have call predecessors, (68), 56 states have call successors, (68) [2025-03-08 05:32:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 556 transitions. [2025-03-08 05:32:13,835 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 556 transitions. Word has length 125 [2025-03-08 05:32:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:13,835 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 556 transitions. [2025-03-08 05:32:13,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:32:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 556 transitions. [2025-03-08 05:32:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:32:13,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:13,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:13,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:32:13,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1028220470, now seen corresponding path program 1 times [2025-03-08 05:32:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336623617] [2025-03-08 05:32:13,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:32:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:32:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336623617] [2025-03-08 05:32:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336623617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039951152] [2025-03-08 05:32:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:13,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:13,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:32:14,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:32:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:32:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:14,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039951152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:14,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:32:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76312257] [2025-03-08 05:32:14,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:14,281 INFO L87 Difference]: Start difference. First operand 363 states and 556 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,397 INFO L93 Difference]: Finished difference Result 858 states and 1366 transitions. [2025-03-08 05:32:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:14,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 126 [2025-03-08 05:32:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,403 INFO L225 Difference]: With dead ends: 858 [2025-03-08 05:32:14,403 INFO L226 Difference]: Without dead ends: 704 [2025-03-08 05:32:14,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:14,404 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 315 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:14,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2116 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-03-08 05:32:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 680. [2025-03-08 05:32:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 536 states have (on average 1.6007462686567164) internal successors, (858), 540 states have internal predecessors, (858), 121 states have call successors, (121), 19 states have call predecessors, (121), 22 states have return successors, (142), 120 states have call predecessors, (142), 120 states have call successors, (142) [2025-03-08 05:32:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1121 transitions. [2025-03-08 05:32:14,432 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1121 transitions. Word has length 126 [2025-03-08 05:32:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:14,433 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1121 transitions. [2025-03-08 05:32:14,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1121 transitions. [2025-03-08 05:32:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:32:14,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:14,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:14,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:14,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:32:14,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 204932235, now seen corresponding path program 1 times [2025-03-08 05:32:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693663791] [2025-03-08 05:32:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:14,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:32:14,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:32:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693663791] [2025-03-08 05:32:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693663791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:14,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:14,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016200503] [2025-03-08 05:32:14,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:14,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:14,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,699 INFO L87 Difference]: Start difference. First operand 680 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,727 INFO L93 Difference]: Finished difference Result 1615 states and 2704 transitions. [2025-03-08 05:32:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:14,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-08 05:32:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,733 INFO L225 Difference]: With dead ends: 1615 [2025-03-08 05:32:14,733 INFO L226 Difference]: Without dead ends: 1001 [2025-03-08 05:32:14,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,735 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 105 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:14,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 922 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-08 05:32:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 993. [2025-03-08 05:32:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 785 states have (on average 1.6191082802547772) internal successors, (1271), 789 states have internal predecessors, (1271), 185 states have call successors, (185), 19 states have call predecessors, (185), 22 states have return successors, (216), 184 states have call predecessors, (216), 184 states have call successors, (216) [2025-03-08 05:32:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1672 transitions. [2025-03-08 05:32:14,771 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1672 transitions. Word has length 133 [2025-03-08 05:32:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1672 transitions. [2025-03-08 05:32:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1672 transitions. [2025-03-08 05:32:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:32:14,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:14,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:32:14,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2003473898, now seen corresponding path program 1 times [2025-03-08 05:32:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:14,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571089462] [2025-03-08 05:32:14,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:14,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:32:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:32:14,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571089462] [2025-03-08 05:32:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571089462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443724354] [2025-03-08 05:32:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:14,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:14,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,849 INFO L87 Difference]: Start difference. First operand 993 states and 1672 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:14,886 INFO L93 Difference]: Finished difference Result 2367 states and 4009 transitions. [2025-03-08 05:32:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 05:32:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:14,894 INFO L225 Difference]: With dead ends: 2367 [2025-03-08 05:32:14,895 INFO L226 Difference]: Without dead ends: 1489 [2025-03-08 05:32:14,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:14,898 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 103 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:14,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-08 05:32:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1481. [2025-03-08 05:32:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1178 states have (on average 1.631578947368421) internal successors, (1922), 1182 states have internal predecessors, (1922), 280 states have call successors, (280), 19 states have call predecessors, (280), 22 states have return successors, (311), 279 states have call predecessors, (311), 279 states have call successors, (311) [2025-03-08 05:32:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2513 transitions. [2025-03-08 05:32:14,955 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2513 transitions. Word has length 134 [2025-03-08 05:32:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:14,955 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2513 transitions. [2025-03-08 05:32:14,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2513 transitions. [2025-03-08 05:32:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:32:14,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:14,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:14,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:32:14,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1974236276, now seen corresponding path program 1 times [2025-03-08 05:32:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477785839] [2025-03-08 05:32:14,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:14,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:32:14,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:32:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477785839] [2025-03-08 05:32:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477785839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185822212] [2025-03-08 05:32:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:15,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,017 INFO L87 Difference]: Start difference. First operand 1481 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,072 INFO L93 Difference]: Finished difference Result 3473 states and 5938 transitions. [2025-03-08 05:32:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 05:32:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,085 INFO L225 Difference]: With dead ends: 3473 [2025-03-08 05:32:15,085 INFO L226 Difference]: Without dead ends: 2225 [2025-03-08 05:32:15,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,091 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 101 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 899 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-08 05:32:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2217. [2025-03-08 05:32:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1791 states have (on average 1.6415410385259632) internal successors, (2940), 1795 states have internal predecessors, (2940), 403 states have call successors, (403), 19 states have call predecessors, (403), 22 states have return successors, (450), 402 states have call predecessors, (450), 402 states have call successors, (450) [2025-03-08 05:32:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3793 transitions. [2025-03-08 05:32:15,191 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3793 transitions. Word has length 135 [2025-03-08 05:32:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,192 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3793 transitions. [2025-03-08 05:32:15,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3793 transitions. [2025-03-08 05:32:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:32:15,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:15,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:15,204 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1655260533, now seen corresponding path program 1 times [2025-03-08 05:32:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406271991] [2025-03-08 05:32:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:32:15,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:32:15,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406271991] [2025-03-08 05:32:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406271991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284273986] [2025-03-08 05:32:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:15,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,272 INFO L87 Difference]: Start difference. First operand 2217 states and 3793 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,373 INFO L93 Difference]: Finished difference Result 5190 states and 8938 transitions. [2025-03-08 05:32:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 05:32:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,392 INFO L225 Difference]: With dead ends: 5190 [2025-03-08 05:32:15,392 INFO L226 Difference]: Without dead ends: 3399 [2025-03-08 05:32:15,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,400 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 99 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 899 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-03-08 05:32:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3391. [2025-03-08 05:32:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3391 states, 2786 states have (on average 1.6482412060301508) internal successors, (4592), 2790 states have internal predecessors, (4592), 582 states have call successors, (582), 19 states have call predecessors, (582), 22 states have return successors, (655), 581 states have call predecessors, (655), 581 states have call successors, (655) [2025-03-08 05:32:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 3391 states and 5829 transitions. [2025-03-08 05:32:15,565 INFO L78 Accepts]: Start accepts. Automaton has 3391 states and 5829 transitions. Word has length 136 [2025-03-08 05:32:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 3391 states and 5829 transitions. [2025-03-08 05:32:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 5829 transitions. [2025-03-08 05:32:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:32:15,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:15,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:15,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:15,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1433185645, now seen corresponding path program 1 times [2025-03-08 05:32:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181866073] [2025-03-08 05:32:15,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:15,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:32:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:32:15,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:15,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:15,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:15,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181866073] [2025-03-08 05:32:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181866073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:15,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:15,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576059165] [2025-03-08 05:32:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,637 INFO L87 Difference]: Start difference. First operand 3391 states and 5829 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:15,802 INFO L93 Difference]: Finished difference Result 8005 states and 13852 transitions. [2025-03-08 05:32:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-08 05:32:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:15,832 INFO L225 Difference]: With dead ends: 8005 [2025-03-08 05:32:15,832 INFO L226 Difference]: Without dead ends: 5336 [2025-03-08 05:32:15,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:15,841 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 97 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:15,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2025-03-08 05:32:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 5328. [2025-03-08 05:32:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5328 states, 4347 states have (on average 1.6448125143777317) internal successors, (7150), 4351 states have internal predecessors, (7150), 958 states have call successors, (958), 19 states have call predecessors, (958), 22 states have return successors, (1075), 957 states have call predecessors, (1075), 957 states have call successors, (1075) [2025-03-08 05:32:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5328 states to 5328 states and 9183 transitions. [2025-03-08 05:32:16,083 INFO L78 Accepts]: Start accepts. Automaton has 5328 states and 9183 transitions. Word has length 137 [2025-03-08 05:32:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,084 INFO L471 AbstractCegarLoop]: Abstraction has 5328 states and 9183 transitions. [2025-03-08 05:32:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5328 states and 9183 transitions. [2025-03-08 05:32:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:32:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:16,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2016331052, now seen corresponding path program 1 times [2025-03-08 05:32:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055436936] [2025-03-08 05:32:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:32:16,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:32:16,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055436936] [2025-03-08 05:32:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055436936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72691522] [2025-03-08 05:32:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:16,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:16,191 INFO L87 Difference]: Start difference. First operand 5328 states and 9183 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:16,438 INFO L93 Difference]: Finished difference Result 13104 states and 22724 transitions. [2025-03-08 05:32:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 05:32:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:16,484 INFO L225 Difference]: With dead ends: 13104 [2025-03-08 05:32:16,484 INFO L226 Difference]: Without dead ends: 8853 [2025-03-08 05:32:16,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:16,503 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 95 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:16,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 906 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-03-08 05:32:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8845. [2025-03-08 05:32:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8845 states, 7258 states have (on average 1.643703499586663) internal successors, (11930), 7262 states have internal predecessors, (11930), 1564 states have call successors, (1564), 19 states have call predecessors, (1564), 22 states have return successors, (1759), 1563 states have call predecessors, (1759), 1563 states have call successors, (1759) [2025-03-08 05:32:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8845 states to 8845 states and 15253 transitions. [2025-03-08 05:32:16,877 INFO L78 Accepts]: Start accepts. Automaton has 8845 states and 15253 transitions. Word has length 138 [2025-03-08 05:32:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 8845 states and 15253 transitions. [2025-03-08 05:32:16,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8845 states and 15253 transitions. [2025-03-08 05:32:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:32:16,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:16,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:16,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:16,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash -2031367890, now seen corresponding path program 1 times [2025-03-08 05:32:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912790300] [2025-03-08 05:32:16,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:16,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:32:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:32:16,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:16,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912790300] [2025-03-08 05:32:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912790300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:16,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:16,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075404562] [2025-03-08 05:32:16,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:16,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:16,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:16,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:16,956 INFO L87 Difference]: Start difference. First operand 8845 states and 15253 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:17,249 INFO L93 Difference]: Finished difference Result 22848 states and 39549 transitions. [2025-03-08 05:32:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-08 05:32:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:17,310 INFO L225 Difference]: With dead ends: 22848 [2025-03-08 05:32:17,310 INFO L226 Difference]: Without dead ends: 15503 [2025-03-08 05:32:17,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:17,341 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 93 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:17,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 919 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15503 states. [2025-03-08 05:32:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15503 to 15495. [2025-03-08 05:32:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15495 states, 12705 states have (on average 1.6347107438016528) internal successors, (20769), 12709 states have internal predecessors, (20769), 2767 states have call successors, (2767), 19 states have call predecessors, (2767), 22 states have return successors, (3106), 2766 states have call predecessors, (3106), 2766 states have call successors, (3106) [2025-03-08 05:32:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 26642 transitions. [2025-03-08 05:32:17,946 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 26642 transitions. Word has length 139 [2025-03-08 05:32:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 15495 states and 26642 transitions. [2025-03-08 05:32:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 26642 transitions. [2025-03-08 05:32:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:32:17,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:17,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:17,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:17,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:17,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1057419085, now seen corresponding path program 1 times [2025-03-08 05:32:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:17,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-08 05:32:17,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:18,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:32:18,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:32:18,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:18,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-08 05:32:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839284758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:18,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:18,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900824223] [2025-03-08 05:32:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:18,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:18,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:18,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,055 INFO L87 Difference]: Start difference. First operand 15495 states and 26642 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:18,819 INFO L93 Difference]: Finished difference Result 40979 states and 70773 transitions. [2025-03-08 05:32:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-08 05:32:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:18,921 INFO L225 Difference]: With dead ends: 40979 [2025-03-08 05:32:18,921 INFO L226 Difference]: Without dead ends: 27589 [2025-03-08 05:32:18,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:18,960 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 91 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:18,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 902 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27589 states. [2025-03-08 05:32:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27589 to 27581. [2025-03-08 05:32:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27581 states, 22752 states have (on average 1.630801687763713) internal successors, (37104), 22756 states have internal predecessors, (37104), 4806 states have call successors, (4806), 19 states have call predecessors, (4806), 22 states have return successors, (5419), 4805 states have call predecessors, (5419), 4805 states have call successors, (5419) [2025-03-08 05:32:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27581 states to 27581 states and 47329 transitions. [2025-03-08 05:32:19,873 INFO L78 Accepts]: Start accepts. Automaton has 27581 states and 47329 transitions. Word has length 140 [2025-03-08 05:32:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:19,873 INFO L471 AbstractCegarLoop]: Abstraction has 27581 states and 47329 transitions. [2025-03-08 05:32:19,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27581 states and 47329 transitions. [2025-03-08 05:32:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:32:19,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:19,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:19,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2003656241, now seen corresponding path program 1 times [2025-03-08 05:32:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001763592] [2025-03-08 05:32:19,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:19,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:32:19,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:32:19,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:19,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001763592] [2025-03-08 05:32:19,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001763592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:19,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:19,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:19,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236037943] [2025-03-08 05:32:19,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:19,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:19,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:19,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:19,991 INFO L87 Difference]: Start difference. First operand 27581 states and 47329 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:21,023 INFO L93 Difference]: Finished difference Result 75126 states and 129385 transitions. [2025-03-08 05:32:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-08 05:32:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:21,267 INFO L225 Difference]: With dead ends: 75126 [2025-03-08 05:32:21,268 INFO L226 Difference]: Without dead ends: 50376 [2025-03-08 05:32:21,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:21,354 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 89 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:21,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 905 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50376 states. [2025-03-08 05:32:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50376 to 50368. [2025-03-08 05:32:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50368 states, 41824 states have (on average 1.6254064651874522) internal successors, (67981), 41828 states have internal predecessors, (67981), 8521 states have call successors, (8521), 19 states have call predecessors, (8521), 22 states have return successors, (9666), 8520 states have call predecessors, (9666), 8520 states have call successors, (9666) [2025-03-08 05:32:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50368 states to 50368 states and 86168 transitions. [2025-03-08 05:32:23,288 INFO L78 Accepts]: Start accepts. Automaton has 50368 states and 86168 transitions. Word has length 141 [2025-03-08 05:32:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 50368 states and 86168 transitions. [2025-03-08 05:32:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50368 states and 86168 transitions. [2025-03-08 05:32:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:32:23,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:23,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:23,347 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1107050982, now seen corresponding path program 2 times [2025-03-08 05:32:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611062039] [2025-03-08 05:32:23,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:23,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 141 statements into 2 equivalence classes. [2025-03-08 05:32:23,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:32:23,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:32:23,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:32:23,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611062039] [2025-03-08 05:32:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611062039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:23,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:23,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718613902] [2025-03-08 05:32:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:23,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:23,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:23,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:23,475 INFO L87 Difference]: Start difference. First operand 50368 states and 86168 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:24,732 INFO L93 Difference]: Finished difference Result 97006 states and 166188 transitions. [2025-03-08 05:32:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:32:24,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-08 05:32:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:24,990 INFO L225 Difference]: With dead ends: 97006 [2025-03-08 05:32:24,990 INFO L226 Difference]: Without dead ends: 50376 [2025-03-08 05:32:25,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:25,119 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 104 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:25,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2772 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50376 states. [2025-03-08 05:32:26,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50376 to 50368. [2025-03-08 05:32:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50368 states, 41824 states have (on average 1.6129016832440703) internal successors, (67458), 41828 states have internal predecessors, (67458), 8521 states have call successors, (8521), 19 states have call predecessors, (8521), 22 states have return successors, (9666), 8520 states have call predecessors, (9666), 8520 states have call successors, (9666) [2025-03-08 05:32:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50368 states to 50368 states and 85645 transitions. [2025-03-08 05:32:26,917 INFO L78 Accepts]: Start accepts. Automaton has 50368 states and 85645 transitions. Word has length 141 [2025-03-08 05:32:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:26,918 INFO L471 AbstractCegarLoop]: Abstraction has 50368 states and 85645 transitions. [2025-03-08 05:32:26,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 50368 states and 85645 transitions. [2025-03-08 05:32:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:32:26,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:26,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:32:26,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 801951218, now seen corresponding path program 1 times [2025-03-08 05:32:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83897884] [2025-03-08 05:32:26,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:32:27,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:32:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:27,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83897884] [2025-03-08 05:32:27,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83897884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:27,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:27,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641856902] [2025-03-08 05:32:27,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:27,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:27,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:27,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:27,060 INFO L87 Difference]: Start difference. First operand 50368 states and 85645 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:29,164 INFO L93 Difference]: Finished difference Result 93868 states and 159938 transitions. [2025-03-08 05:32:29,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:29,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-08 05:32:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:29,672 INFO L225 Difference]: With dead ends: 93868 [2025-03-08 05:32:29,673 INFO L226 Difference]: Without dead ends: 93714 [2025-03-08 05:32:29,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:29,748 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 84 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:29,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 916 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93714 states. [2025-03-08 05:32:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93714 to 93706. [2025-03-08 05:32:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93706 states, 78363 states have (on average 1.6052728966476526) internal successors, (125794), 78367 states have internal predecessors, (125794), 15320 states have call successors, (15320), 19 states have call predecessors, (15320), 22 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2025-03-08 05:32:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93706 states to 93706 states and 158625 transitions. [2025-03-08 05:32:33,028 INFO L78 Accepts]: Start accepts. Automaton has 93706 states and 158625 transitions. Word has length 142 [2025-03-08 05:32:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 93706 states and 158625 transitions. [2025-03-08 05:32:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 93706 states and 158625 transitions. [2025-03-08 05:32:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 05:32:33,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:33,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:32:33,110 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:33,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1212422832, now seen corresponding path program 1 times [2025-03-08 05:32:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947824933] [2025-03-08 05:32:33,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:33,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 05:32:33,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 05:32:33,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:33,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947824933] [2025-03-08 05:32:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947824933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:33,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:32:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405140381] [2025-03-08 05:32:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:33,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:33,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:33,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:33,249 INFO L87 Difference]: Start difference. First operand 93706 states and 158625 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:35,436 INFO L93 Difference]: Finished difference Result 94004 states and 159038 transitions. [2025-03-08 05:32:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:32:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-03-08 05:32:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:35,888 INFO L225 Difference]: With dead ends: 94004 [2025-03-08 05:32:35,888 INFO L226 Difference]: Without dead ends: 93858 [2025-03-08 05:32:35,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:35,944 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 389 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:35,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2061 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:32:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93858 states. [2025-03-08 05:32:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93858 to 93854. [2025-03-08 05:32:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93854 states, 78481 states have (on average 1.6049871943527734) internal successors, (125961), 78485 states have internal predecessors, (125961), 15338 states have call successors, (15338), 29 states have call predecessors, (15338), 34 states have return successors, (17532), 15339 states have call predecessors, (17532), 15336 states have call successors, (17532) [2025-03-08 05:32:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93854 states to 93854 states and 158831 transitions. [2025-03-08 05:32:39,435 INFO L78 Accepts]: Start accepts. Automaton has 93854 states and 158831 transitions. Word has length 143 [2025-03-08 05:32:39,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:39,435 INFO L471 AbstractCegarLoop]: Abstraction has 93854 states and 158831 transitions. [2025-03-08 05:32:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:32:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 93854 states and 158831 transitions. [2025-03-08 05:32:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:32:39,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:39,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:39,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:32:39,506 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -67406094, now seen corresponding path program 1 times [2025-03-08 05:32:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595153119] [2025-03-08 05:32:39,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:39,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:32:39,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:32:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595153119] [2025-03-08 05:32:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595153119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:32:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292469839] [2025-03-08 05:32:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:39,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:32:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:32:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:32:39,807 INFO L87 Difference]: Start difference. First operand 93854 states and 158831 transitions. Second operand has 13 states, 11 states have (on average 9.0) internal successors, (99), 12 states have internal predecessors, (99), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15)