./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product28.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 4246354e79d66df81a26382f92e3cfb9fdaf25fcf22b56dfc59f3e4dbd0d435a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:17:26,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:17:26,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:17:26,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:17:26,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:17:26,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:17:26,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:17:26,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:17:26,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:17:26,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:17:26,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:17:26,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:17:26,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:17:26,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:17:26,392 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:17:26,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:17:26,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:17:26,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:17:26,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:17:26,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:17:26,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:17:26,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:17:26,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:17:26,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:17:26,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:17:26,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:17:26,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:17:26,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:17:26,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:17:26,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:17:26,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:17:26,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:17:26,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:26,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:17:26,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:17:26,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:17:26,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:17:26,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:17:26,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:17:26,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:17:26,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:17:26,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:17:26,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 4246354e79d66df81a26382f92e3cfb9fdaf25fcf22b56dfc59f3e4dbd0d435a [2024-10-12 19:17:26,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:17:26,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:17:26,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:17:26,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:17:26,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:17:26,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c [2024-10-12 19:17:28,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:17:28,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:17:28,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product28.cil.c [2024-10-12 19:17:28,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe04be2a1/e0e2e1af7bef4093892581523a2cc243/FLAGf6f497b10 [2024-10-12 19:17:28,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe04be2a1/e0e2e1af7bef4093892581523a2cc243 [2024-10-12 19:17:28,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:17:28,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:17:28,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:28,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:17:28,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:17:28,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:28" (1/1) ... [2024-10-12 19:17:28,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14509be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:28, skipping insertion in model container [2024-10-12 19:17:28,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:17:28" (1/1) ... [2024-10-12 19:17:28,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:17:28,935 WARN L248 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/elevator_spec2_product28.cil.c[35981,35994] [2024-10-12 19:17:29,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:29,107 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:17:29,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [48] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1664] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1702] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1711] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2373] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2387] [2024-10-12 19:17:29,120 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2506] [2024-10-12 19:17:29,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2859] [2024-10-12 19:17:29,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3225] [2024-10-12 19:17:29,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3316] [2024-10-12 19:17:29,191 WARN L248 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/elevator_spec2_product28.cil.c[35981,35994] [2024-10-12 19:17:29,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:17:29,309 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:17:29,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29 WrapperNode [2024-10-12 19:17:29,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:17:29,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:29,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:17:29,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:17:29,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,390 INFO L138 Inliner]: procedures = 97, calls = 348, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 1177 [2024-10-12 19:17:29,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:17:29,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:17:29,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:17:29,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:17:29,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,454 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:17:29,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:17:29,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:17:29,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:17:29,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:17:29,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (1/1) ... [2024-10-12 19:17:29,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:17:29,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:17:29,578 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) [2024-10-12 19:17:29,581 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 [2024-10-12 19:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-12 19:17:29,635 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-12 19:17:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:17:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:17:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:17:29,636 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:17:29,636 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:17:29,637 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:17:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:17:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:17:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:17:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:17:29,639 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:17:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:17:29,640 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:17:29,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:17:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-12 19:17:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-12 19:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:17:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:17:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:17:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-12 19:17:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-12 19:17:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:17:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:17:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:17:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-12 19:17:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2024-10-12 19:17:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:17:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:17:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:17:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:17:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:17:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:17:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:17:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:17:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:17:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:17:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:17:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:17:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:17:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-12 19:17:29,649 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-12 19:17:29,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:17:29,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:17:31,162 INFO L? ?]: Removed 463 outVars from TransFormulas that were not future-live. [2024-10-12 19:17:31,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:17:31,254 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:17:31,255 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:17:31,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:31 BoogieIcfgContainer [2024-10-12 19:17:31,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:17:31,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:17:31,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:17:31,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:17:31,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:17:28" (1/3) ... [2024-10-12 19:17:31,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2657ccfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:31, skipping insertion in model container [2024-10-12 19:17:31,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:17:29" (2/3) ... [2024-10-12 19:17:31,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2657ccfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:17:31, skipping insertion in model container [2024-10-12 19:17:31,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:17:31" (3/3) ... [2024-10-12 19:17:31,265 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product28.cil.c [2024-10-12 19:17:31,280 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:17:31,281 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:17:31,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:17:31,380 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;@3b267e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:17:31,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:17:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 556 states, 430 states have (on average 1.7232558139534884) internal successors, (741), 453 states have internal predecessors, (741), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-12 19:17:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:17:31,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:31,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:31,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:31,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:31,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1411052936, now seen corresponding path program 1 times [2024-10-12 19:17:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272652698] [2024-10-12 19:17:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:17:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:17:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:32,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272652698] [2024-10-12 19:17:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272652698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899479957] [2024-10-12 19:17:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:32,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:32,746 INFO L87 Difference]: Start difference. First operand has 556 states, 430 states have (on average 1.7232558139534884) internal successors, (741), 453 states have internal predecessors, (741), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 92 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:37,700 INFO L93 Difference]: Finished difference Result 1257 states and 2149 transitions. [2024-10-12 19:17:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-10-12 19:17:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:37,724 INFO L225 Difference]: With dead ends: 1257 [2024-10-12 19:17:37,724 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:17:37,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:37,735 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 691 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:37,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1101 Invalid, 2934 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:17:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:17:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-12 19:17:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.7126168224299065) internal successors, (733), 449 states have internal predecessors, (733), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 926 transitions. [2024-10-12 19:17:37,905 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 926 transitions. Word has length 50 [2024-10-12 19:17:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:37,905 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 926 transitions. [2024-10-12 19:17:37,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 926 transitions. [2024-10-12 19:17:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:17:37,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:37,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:37,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:17:37,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 920878566, now seen corresponding path program 1 times [2024-10-12 19:17:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334638963] [2024-10-12 19:17:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:17:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:38,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334638963] [2024-10-12 19:17:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334638963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178429022] [2024-10-12 19:17:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:38,585 INFO L87 Difference]: Start difference. First operand 552 states and 926 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:42,847 INFO L93 Difference]: Finished difference Result 1250 states and 2122 transitions. [2024-10-12 19:17:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:42,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2024-10-12 19:17:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:42,855 INFO L225 Difference]: With dead ends: 1250 [2024-10-12 19:17:42,855 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:17:42,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:42,859 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1127 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:42,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1090 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-12 19:17:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:17:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-12 19:17:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.7102803738317758) internal successors, (732), 449 states have internal predecessors, (732), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 925 transitions. [2024-10-12 19:17:42,973 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 925 transitions. Word has length 52 [2024-10-12 19:17:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 925 transitions. [2024-10-12 19:17:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 925 transitions. [2024-10-12 19:17:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:17:42,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:42,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:42,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:17:42,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:42,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1548364352, now seen corresponding path program 1 times [2024-10-12 19:17:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990554156] [2024-10-12 19:17:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:17:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 19:17:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990554156] [2024-10-12 19:17:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990554156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:43,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202713803] [2024-10-12 19:17:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:43,543 INFO L87 Difference]: Start difference. First operand 552 states and 925 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:47,362 INFO L93 Difference]: Finished difference Result 1250 states and 2121 transitions. [2024-10-12 19:17:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-10-12 19:17:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:47,368 INFO L225 Difference]: With dead ends: 1250 [2024-10-12 19:17:47,368 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:17:47,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:47,372 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1126 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:47,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1084 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:17:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:17:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-12 19:17:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.7079439252336448) internal successors, (731), 449 states have internal predecessors, (731), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 924 transitions. [2024-10-12 19:17:47,461 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 924 transitions. Word has length 53 [2024-10-12 19:17:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 924 transitions. [2024-10-12 19:17:47,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 924 transitions. [2024-10-12 19:17:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 19:17:47,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:47,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:47,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:17:47,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:47,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1001489194, now seen corresponding path program 1 times [2024-10-12 19:17:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214631392] [2024-10-12 19:17:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:17:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:17:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:47,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:48,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:48,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214631392] [2024-10-12 19:17:48,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214631392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785706200] [2024-10-12 19:17:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:48,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:48,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:48,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:48,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:48,019 INFO L87 Difference]: Start difference. First operand 552 states and 924 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:51,996 INFO L93 Difference]: Finished difference Result 1250 states and 2120 transitions. [2024-10-12 19:17:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-12 19:17:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:52,002 INFO L225 Difference]: With dead ends: 1250 [2024-10-12 19:17:52,003 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:17:52,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:52,006 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1129 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:52,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 1054 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-12 19:17:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:17:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-12 19:17:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.705607476635514) internal successors, (730), 449 states have internal predecessors, (730), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 923 transitions. [2024-10-12 19:17:52,092 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 923 transitions. Word has length 54 [2024-10-12 19:17:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:52,093 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 923 transitions. [2024-10-12 19:17:52,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 923 transitions. [2024-10-12 19:17:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 19:17:52,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:52,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:52,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:17:52,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 229543172, now seen corresponding path program 1 times [2024-10-12 19:17:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104040361] [2024-10-12 19:17:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:17:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:17:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104040361] [2024-10-12 19:17:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104040361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49478972] [2024-10-12 19:17:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:52,665 INFO L87 Difference]: Start difference. First operand 552 states and 923 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:17:56,272 INFO L93 Difference]: Finished difference Result 1250 states and 2119 transitions. [2024-10-12 19:17:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:17:56,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2024-10-12 19:17:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:17:56,278 INFO L225 Difference]: With dead ends: 1250 [2024-10-12 19:17:56,278 INFO L226 Difference]: Without dead ends: 710 [2024-10-12 19:17:56,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:17:56,281 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1123 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:17:56,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1069 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2632 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:17:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-12 19:17:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 552. [2024-10-12 19:17:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.7032710280373833) internal successors, (729), 449 states have internal predecessors, (729), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:17:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 922 transitions. [2024-10-12 19:17:56,366 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 922 transitions. Word has length 55 [2024-10-12 19:17:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:17:56,367 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 922 transitions. [2024-10-12 19:17:56,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:17:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 922 transitions. [2024-10-12 19:17:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 19:17:56,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:17:56,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:17:56,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:17:56,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:17:56,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:17:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash -438974354, now seen corresponding path program 1 times [2024-10-12 19:17:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:17:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069274182] [2024-10-12 19:17:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:17:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:17:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:17:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:17:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:17:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:17:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:17:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:17:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:17:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:17:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069274182] [2024-10-12 19:17:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069274182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:17:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:17:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:17:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661885666] [2024-10-12 19:17:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:17:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:17:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:17:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:17:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:17:56,959 INFO L87 Difference]: Start difference. First operand 552 states and 922 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:00,346 INFO L93 Difference]: Finished difference Result 1220 states and 2058 transitions. [2024-10-12 19:18:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2024-10-12 19:18:00,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:00,351 INFO L225 Difference]: With dead ends: 1220 [2024-10-12 19:18:00,351 INFO L226 Difference]: Without dead ends: 720 [2024-10-12 19:18:00,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:00,354 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1187 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:00,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1069 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:18:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-12 19:18:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 552. [2024-10-12 19:18:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.691588785046729) internal successors, (724), 449 states have internal predecessors, (724), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:18:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 917 transitions. [2024-10-12 19:18:00,442 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 917 transitions. Word has length 56 [2024-10-12 19:18:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:00,442 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 917 transitions. [2024-10-12 19:18:00,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 917 transitions. [2024-10-12 19:18:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:18:00,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:00,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:18:00,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:00,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1199868890, now seen corresponding path program 1 times [2024-10-12 19:18:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011936348] [2024-10-12 19:18:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:00,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:18:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:01,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011936348] [2024-10-12 19:18:01,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011936348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:01,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:01,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:01,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579468870] [2024-10-12 19:18:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:01,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:01,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:01,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:01,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:01,033 INFO L87 Difference]: Start difference. First operand 552 states and 917 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:04,494 INFO L93 Difference]: Finished difference Result 1220 states and 2053 transitions. [2024-10-12 19:18:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-12 19:18:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:04,499 INFO L225 Difference]: With dead ends: 1220 [2024-10-12 19:18:04,499 INFO L226 Difference]: Without dead ends: 720 [2024-10-12 19:18:04,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:04,502 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1184 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:04,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1075 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 19:18:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-12 19:18:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 552. [2024-10-12 19:18:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.6799065420560748) internal successors, (719), 449 states have internal predecessors, (719), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:18:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 912 transitions. [2024-10-12 19:18:04,584 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 912 transitions. Word has length 57 [2024-10-12 19:18:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:04,584 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 912 transitions. [2024-10-12 19:18:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 912 transitions. [2024-10-12 19:18:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:18:04,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:04,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:04,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:18:04,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:04,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 556289673, now seen corresponding path program 1 times [2024-10-12 19:18:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201478599] [2024-10-12 19:18:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:04,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:18:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201478599] [2024-10-12 19:18:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201478599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:05,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287775355] [2024-10-12 19:18:05,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:05,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:05,255 INFO L87 Difference]: Start difference. First operand 552 states and 912 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:10,615 INFO L93 Difference]: Finished difference Result 1226 states and 2058 transitions. [2024-10-12 19:18:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:18:10,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:18:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:10,622 INFO L225 Difference]: With dead ends: 1226 [2024-10-12 19:18:10,622 INFO L226 Difference]: Without dead ends: 734 [2024-10-12 19:18:10,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:18:10,626 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 760 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 4990 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:10,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1948 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4990 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:18:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-12 19:18:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 564. [2024-10-12 19:18:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.677345537757437) internal successors, (733), 460 states have internal predecessors, (733), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 930 transitions. [2024-10-12 19:18:10,749 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 930 transitions. Word has length 58 [2024-10-12 19:18:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:10,752 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 930 transitions. [2024-10-12 19:18:10,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 930 transitions. [2024-10-12 19:18:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:18:10,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:10,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:10,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:18:10,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1767738166, now seen corresponding path program 1 times [2024-10-12 19:18:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207496426] [2024-10-12 19:18:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:10,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:18:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:11,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:11,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207496426] [2024-10-12 19:18:11,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207496426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264544273] [2024-10-12 19:18:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:11,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:11,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:11,229 INFO L87 Difference]: Start difference. First operand 564 states and 930 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:14,558 INFO L93 Difference]: Finished difference Result 1248 states and 2096 transitions. [2024-10-12 19:18:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 19:18:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:14,563 INFO L225 Difference]: With dead ends: 1248 [2024-10-12 19:18:14,563 INFO L226 Difference]: Without dead ends: 740 [2024-10-12 19:18:14,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:14,566 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1182 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:14,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1084 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:18:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-12 19:18:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 564. [2024-10-12 19:18:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.665903890160183) internal successors, (728), 460 states have internal predecessors, (728), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 925 transitions. [2024-10-12 19:18:14,661 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 925 transitions. Word has length 58 [2024-10-12 19:18:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:14,662 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 925 transitions. [2024-10-12 19:18:14,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 925 transitions. [2024-10-12 19:18:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:18:14,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:14,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:14,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:18:14,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:14,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2052078496, now seen corresponding path program 1 times [2024-10-12 19:18:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:14,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668399665] [2024-10-12 19:18:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:18:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668399665] [2024-10-12 19:18:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668399665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:15,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:15,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020167558] [2024-10-12 19:18:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:15,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:15,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:15,198 INFO L87 Difference]: Start difference. First operand 564 states and 925 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:20,264 INFO L93 Difference]: Finished difference Result 1228 states and 2054 transitions. [2024-10-12 19:18:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:20,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-10-12 19:18:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:20,269 INFO L225 Difference]: With dead ends: 1228 [2024-10-12 19:18:20,270 INFO L226 Difference]: Without dead ends: 734 [2024-10-12 19:18:20,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:20,272 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 729 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 4938 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:20,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1900 Invalid, 5068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4938 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-12 19:18:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-12 19:18:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 564. [2024-10-12 19:18:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.6636155606407323) internal successors, (727), 460 states have internal predecessors, (727), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 924 transitions. [2024-10-12 19:18:20,368 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 924 transitions. Word has length 59 [2024-10-12 19:18:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 924 transitions. [2024-10-12 19:18:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 924 transitions. [2024-10-12 19:18:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:18:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:20,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:18:20,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -293703296, now seen corresponding path program 1 times [2024-10-12 19:18:20,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:20,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619470598] [2024-10-12 19:18:20,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:18:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619470598] [2024-10-12 19:18:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619470598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619897345] [2024-10-12 19:18:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:20,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:20,851 INFO L87 Difference]: Start difference. First operand 564 states and 924 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:24,393 INFO L93 Difference]: Finished difference Result 1248 states and 2087 transitions. [2024-10-12 19:18:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-12 19:18:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:24,398 INFO L225 Difference]: With dead ends: 1248 [2024-10-12 19:18:24,398 INFO L226 Difference]: Without dead ends: 740 [2024-10-12 19:18:24,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:24,401 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1184 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:24,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1050 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:18:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-12 19:18:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 564. [2024-10-12 19:18:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.6521739130434783) internal successors, (722), 460 states have internal predecessors, (722), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 919 transitions. [2024-10-12 19:18:24,497 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 919 transitions. Word has length 59 [2024-10-12 19:18:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:24,497 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 919 transitions. [2024-10-12 19:18:24,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 919 transitions. [2024-10-12 19:18:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:18:24,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:24,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:18:24,499 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 730915207, now seen corresponding path program 1 times [2024-10-12 19:18:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:24,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216901535] [2024-10-12 19:18:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:25,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216901535] [2024-10-12 19:18:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216901535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896154857] [2024-10-12 19:18:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:25,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:25,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:25,069 INFO L87 Difference]: Start difference. First operand 564 states and 919 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:28,518 INFO L93 Difference]: Finished difference Result 1232 states and 2053 transitions. [2024-10-12 19:18:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:18:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-12 19:18:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:28,524 INFO L225 Difference]: With dead ends: 1232 [2024-10-12 19:18:28,524 INFO L226 Difference]: Without dead ends: 736 [2024-10-12 19:18:28,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:28,527 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1167 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:28,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1023 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:18:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-12 19:18:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-12 19:18:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 440 states have (on average 1.6454545454545455) internal successors, (724), 463 states have internal predecessors, (724), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 921 transitions. [2024-10-12 19:18:28,659 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 921 transitions. Word has length 60 [2024-10-12 19:18:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:28,661 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 921 transitions. [2024-10-12 19:18:28,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 921 transitions. [2024-10-12 19:18:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 19:18:28,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:28,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:28,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:18:28,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:28,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2025790117, now seen corresponding path program 1 times [2024-10-12 19:18:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689776797] [2024-10-12 19:18:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:18:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689776797] [2024-10-12 19:18:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689776797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:29,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899147327] [2024-10-12 19:18:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:29,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:29,116 INFO L87 Difference]: Start difference. First operand 567 states and 921 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:32,302 INFO L93 Difference]: Finished difference Result 1257 states and 2087 transitions. [2024-10-12 19:18:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:18:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-12 19:18:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:32,307 INFO L225 Difference]: With dead ends: 1257 [2024-10-12 19:18:32,307 INFO L226 Difference]: Without dead ends: 746 [2024-10-12 19:18:32,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:32,309 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1178 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 2800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:32,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 1075 Invalid, 2800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 19:18:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-12 19:18:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 567. [2024-10-12 19:18:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 440 states have (on average 1.634090909090909) internal successors, (719), 463 states have internal predecessors, (719), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 916 transitions. [2024-10-12 19:18:32,392 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 916 transitions. Word has length 60 [2024-10-12 19:18:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:32,392 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 916 transitions. [2024-10-12 19:18:32,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 916 transitions. [2024-10-12 19:18:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:18:32,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:32,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:18:32,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:32,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2029026533, now seen corresponding path program 1 times [2024-10-12 19:18:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738211797] [2024-10-12 19:18:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:32,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738211797] [2024-10-12 19:18:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738211797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:18:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484998196] [2024-10-12 19:18:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:18:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:18:32,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:18:32,987 INFO L87 Difference]: Start difference. First operand 567 states and 916 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:37,999 INFO L93 Difference]: Finished difference Result 1244 states and 2058 transitions. [2024-10-12 19:18:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:18:37,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2024-10-12 19:18:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:38,003 INFO L225 Difference]: With dead ends: 1244 [2024-10-12 19:18:38,003 INFO L226 Difference]: Without dead ends: 748 [2024-10-12 19:18:38,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:18:38,005 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 722 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 4838 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:38,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1919 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4838 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:18:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-12 19:18:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 571. [2024-10-12 19:18:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 444 states have (on average 1.6261261261261262) internal successors, (722), 467 states have internal predecessors, (722), 100 states have call successors, (100), 25 states have call predecessors, (100), 26 states have return successors, (97), 92 states have call predecessors, (97), 95 states have call successors, (97) [2024-10-12 19:18:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 919 transitions. [2024-10-12 19:18:38,096 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 919 transitions. Word has length 61 [2024-10-12 19:18:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:38,097 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 919 transitions. [2024-10-12 19:18:38,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:18:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 919 transitions. [2024-10-12 19:18:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:18:38,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:38,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:38,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:18:38,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 489727291, now seen corresponding path program 1 times [2024-10-12 19:18:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264320307] [2024-10-12 19:18:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264320307] [2024-10-12 19:18:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264320307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645304208] [2024-10-12 19:18:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:38,567 INFO L87 Difference]: Start difference. First operand 571 states and 919 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:42,149 INFO L93 Difference]: Finished difference Result 1295 states and 2117 transitions. [2024-10-12 19:18:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:18:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-12 19:18:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:42,154 INFO L225 Difference]: With dead ends: 1295 [2024-10-12 19:18:42,155 INFO L226 Difference]: Without dead ends: 718 [2024-10-12 19:18:42,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:42,157 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1120 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:42,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1036 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 19:18:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-12 19:18:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 553. [2024-10-12 19:18:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 429 states have (on average 1.634032634032634) internal successors, (701), 450 states have internal predecessors, (701), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:18:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 894 transitions. [2024-10-12 19:18:42,242 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 894 transitions. Word has length 61 [2024-10-12 19:18:42,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:42,243 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 894 transitions. [2024-10-12 19:18:42,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 894 transitions. [2024-10-12 19:18:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 19:18:42,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:42,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:42,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:18:42,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:42,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash -526307870, now seen corresponding path program 1 times [2024-10-12 19:18:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:42,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086117366] [2024-10-12 19:18:42,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:42,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086117366] [2024-10-12 19:18:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086117366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:42,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:18:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494031220] [2024-10-12 19:18:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:18:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:18:42,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:18:42,759 INFO L87 Difference]: Start difference. First operand 553 states and 894 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:46,539 INFO L93 Difference]: Finished difference Result 1222 states and 2022 transitions. [2024-10-12 19:18:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:18:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-12 19:18:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:46,545 INFO L225 Difference]: With dead ends: 1222 [2024-10-12 19:18:46,545 INFO L226 Difference]: Without dead ends: 728 [2024-10-12 19:18:46,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:46,547 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 701 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:46,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1025 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 19:18:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-12 19:18:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 558. [2024-10-12 19:18:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 434 states have (on average 1.6267281105990783) internal successors, (706), 455 states have internal predecessors, (706), 99 states have call successors, (99), 25 states have call predecessors, (99), 24 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-12 19:18:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 899 transitions. [2024-10-12 19:18:46,635 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 899 transitions. Word has length 62 [2024-10-12 19:18:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:46,636 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 899 transitions. [2024-10-12 19:18:46,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:18:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 899 transitions. [2024-10-12 19:18:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:18:46,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:46,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:46,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:18:46,637 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1633963462, now seen corresponding path program 1 times [2024-10-12 19:18:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50657885] [2024-10-12 19:18:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:18:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:18:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50657885] [2024-10-12 19:18:47,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50657885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:47,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:47,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:18:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652699718] [2024-10-12 19:18:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:47,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:18:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:18:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:18:47,312 INFO L87 Difference]: Start difference. First operand 558 states and 899 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7)