./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_spec3_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:37:26,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:37:26,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:37:26,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:37:26,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:37:26,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:37:26,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:37:26,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:37:26,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:37:26,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:37:26,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:37:26,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:37:26,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:37:26,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:37:26,558 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:37:26,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:37:26,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:37:26,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:37:26,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:37:26,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:37:26,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:37:26,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:37:26,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:37:26,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:37:26,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:37:26,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:37:26,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:37:26,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:37:26,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:37:26,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:37:26,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:37:26,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:37:26,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:26,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:37:26,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:37:26,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:37:26,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:37:26,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:37:26,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:37:26,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:37:26,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:37:26,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:37:26,568 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-clean/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-clean/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 -> 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 [2024-10-11 02:37:26,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:37:26,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:37:26,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:37:26,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:37:26,840 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:37:26,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2024-10-11 02:37:28,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:37:28,635 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:37:28,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2024-10-11 02:37:28,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2054229c4/6f4dedccf7ec4d5588394356d0103c3c/FLAG08d1f436b [2024-10-11 02:37:28,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2054229c4/6f4dedccf7ec4d5588394356d0103c3c [2024-10-11 02:37:28,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:37:28,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:37:28,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:28,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:37:28,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:37:28,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:28" (1/1) ... [2024-10-11 02:37:28,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce3615d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:28, skipping insertion in model container [2024-10-11 02:37:28,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:37:28" (1/1) ... [2024-10-11 02:37:28,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:37:29,223 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_spec3_product21.cil.c[62420,62433] [2024-10-11 02:37:29,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:29,298 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:37:29,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:37:29,310 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2024-10-11 02:37:29,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2024-10-11 02:37:29,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [622] [2024-10-11 02:37:29,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2141] [2024-10-11 02:37:29,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2802] [2024-10-11 02:37:29,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2817] [2024-10-11 02:37:29,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2024-10-11 02:37:29,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3013] [2024-10-11 02:37:29,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3379] [2024-10-11 02:37:29,379 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_spec3_product21.cil.c[62420,62433] [2024-10-11 02:37:29,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:37:29,497 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:37:29,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29 WrapperNode [2024-10-11 02:37:29,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:37:29,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:29,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:37:29,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:37:29,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,591 INFO L138 Inliner]: procedures = 90, calls = 345, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 883 [2024-10-11 02:37:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:37:29,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:37:29,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:37:29,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:37:29,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,647 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-11 02:37:29,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:37:29,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:37:29,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:37:29,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:37:29,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (1/1) ... [2024-10-11 02:37:29,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:37:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:37:29,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:37:29,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:37:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:37:29,803 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-11 02:37:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-11 02:37:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:37:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:37:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:37:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:37:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:37:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:37:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-11 02:37:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-11 02:37:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:37:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:37:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:37:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:37:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:37:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:37:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:37:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:37:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:37:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:37:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:37:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-11 02:37:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-11 02:37:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:37:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-11 02:37:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:37:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:37:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:37:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:37:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:37:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:37:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:37:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:37:29,810 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:37:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:37:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-11 02:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:37:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:37:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:37:29,986 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:37:29,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:37:31,242 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2024-10-11 02:37:31,243 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:37:31,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:37:31,327 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:37:31,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:31 BoogieIcfgContainer [2024-10-11 02:37:31,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:37:31,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:37:31,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:37:31,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:37:31,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:37:28" (1/3) ... [2024-10-11 02:37:31,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:31, skipping insertion in model container [2024-10-11 02:37:31,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:37:29" (2/3) ... [2024-10-11 02:37:31,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876857e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:37:31, skipping insertion in model container [2024-10-11 02:37:31,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:37:31" (3/3) ... [2024-10-11 02:37:31,341 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product21.cil.c [2024-10-11 02:37:31,360 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:37:31,360 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:37:31,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:37:31,459 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;@6a892ce0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:37:31,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:37:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 567 states, 433 states have (on average 1.7090069284064666) internal successors, (740), 451 states have internal predecessors, (740), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2024-10-11 02:37:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:37:31,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:31,509 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:31,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:31,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1963638961, now seen corresponding path program 1 times [2024-10-11 02:37:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:31,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466535176] [2024-10-11 02:37:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:37:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 02:37:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:37:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:37:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:37:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:37:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466535176] [2024-10-11 02:37:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466535176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:33,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:33,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345632773] [2024-10-11 02:37:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:33,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:33,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:33,066 INFO L87 Difference]: Start difference. First operand has 567 states, 433 states have (on average 1.7090069284064666) internal successors, (740), 451 states have internal predecessors, (740), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:37:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:41,457 INFO L93 Difference]: Finished difference Result 1472 states and 2579 transitions. [2024-10-11 02:37:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:37:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 89 [2024-10-11 02:37:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:41,493 INFO L225 Difference]: With dead ends: 1472 [2024-10-11 02:37:41,494 INFO L226 Difference]: Without dead ends: 902 [2024-10-11 02:37:41,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:37:41,509 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1155 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 5685 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 5963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 5685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:41,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 2925 Invalid, 5963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [278 Valid, 5685 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-11 02:37:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-11 02:37:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 573. [2024-10-11 02:37:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 439 states have (on average 1.6947608200455582) internal successors, (744), 457 states have internal predecessors, (744), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-10-11 02:37:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 957 transitions. [2024-10-11 02:37:41,766 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 957 transitions. Word has length 89 [2024-10-11 02:37:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 957 transitions. [2024-10-11 02:37:41,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:37:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 957 transitions. [2024-10-11 02:37:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:37:41,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:41,773 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:37:41,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1041295001, now seen corresponding path program 1 times [2024-10-11 02:37:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812116444] [2024-10-11 02:37:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:37:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:37:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:37:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:37:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:37:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:42,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812116444] [2024-10-11 02:37:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812116444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108345042] [2024-10-11 02:37:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:42,579 INFO L87 Difference]: Start difference. First operand 573 states and 957 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:37:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:49,152 INFO L93 Difference]: Finished difference Result 1465 states and 2528 transitions. [2024-10-11 02:37:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 90 [2024-10-11 02:37:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:49,162 INFO L225 Difference]: With dead ends: 1465 [2024-10-11 02:37:49,162 INFO L226 Difference]: Without dead ends: 902 [2024-10-11 02:37:49,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:49,169 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 2195 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 5357 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 6056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 5357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:49,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 2841 Invalid, 6056 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [699 Valid, 5357 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 02:37:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-11 02:37:49,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 573. [2024-10-11 02:37:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 439 states have (on average 1.6924829157175398) internal successors, (743), 457 states have internal predecessors, (743), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-10-11 02:37:49,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 956 transitions. [2024-10-11 02:37:49,337 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 956 transitions. Word has length 90 [2024-10-11 02:37:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 956 transitions. [2024-10-11 02:37:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:37:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 956 transitions. [2024-10-11 02:37:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:37:49,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:49,343 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:49,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:37:49,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1763470675, now seen corresponding path program 1 times [2024-10-11 02:37:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:49,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418642855] [2024-10-11 02:37:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:37:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:37:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:37:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:37:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:37:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:37:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:37:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418642855] [2024-10-11 02:37:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418642855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618576676] [2024-10-11 02:37:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:49,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:49,934 INFO L87 Difference]: Start difference. First operand 573 states and 956 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:37:55,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:55,440 INFO L93 Difference]: Finished difference Result 1459 states and 2511 transitions. [2024-10-11 02:37:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:55,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-10-11 02:37:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:55,447 INFO L225 Difference]: With dead ends: 1459 [2024-10-11 02:37:55,448 INFO L226 Difference]: Without dead ends: 867 [2024-10-11 02:37:55,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:55,452 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1032 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:55,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1559 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:37:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-11 02:37:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 550. [2024-10-11 02:37:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 419 states have (on average 1.6825775656324582) internal successors, (705), 435 states have internal predecessors, (705), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:37:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 914 transitions. [2024-10-11 02:37:55,604 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 914 transitions. Word has length 90 [2024-10-11 02:37:55,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:55,606 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 914 transitions. [2024-10-11 02:37:55,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:37:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 914 transitions. [2024-10-11 02:37:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:37:55,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:55,609 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:37:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:37:55,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:55,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -980477251, now seen corresponding path program 1 times [2024-10-11 02:37:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65242169] [2024-10-11 02:37:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:37:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:37:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:37:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:37:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:37:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:37:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:37:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:37:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:37:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:56,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65242169] [2024-10-11 02:37:56,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65242169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:56,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:56,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:56,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722295408] [2024-10-11 02:37:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:56,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:56,334 INFO L87 Difference]: Start difference. First operand 550 states and 914 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:02,744 INFO L93 Difference]: Finished difference Result 1423 states and 2443 transitions. [2024-10-11 02:38:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 91 [2024-10-11 02:38:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:02,751 INFO L225 Difference]: With dead ends: 1423 [2024-10-11 02:38:02,751 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 02:38:02,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:02,756 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1086 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 5477 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2841 SdHoareTripleChecker+Invalid, 5749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:02,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2841 Invalid, 5749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5477 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 02:38:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 02:38:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-11 02:38:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 413 states have (on average 1.675544794188862) internal successors, (692), 429 states have internal predecessors, (692), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 901 transitions. [2024-10-11 02:38:02,870 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 901 transitions. Word has length 91 [2024-10-11 02:38:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:02,870 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 901 transitions. [2024-10-11 02:38:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 901 transitions. [2024-10-11 02:38:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:38:02,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:02,873 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:02,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:38:02,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1783477327, now seen corresponding path program 1 times [2024-10-11 02:38:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109050380] [2024-10-11 02:38:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:38:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:38:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:38:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:38:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:38:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:03,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109050380] [2024-10-11 02:38:03,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109050380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:03,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:03,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164282508] [2024-10-11 02:38:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:03,564 INFO L87 Difference]: Start difference. First operand 544 states and 901 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:08,046 INFO L93 Difference]: Finished difference Result 1395 states and 2394 transitions. [2024-10-11 02:38:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:38:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-11 02:38:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:08,053 INFO L225 Difference]: With dead ends: 1395 [2024-10-11 02:38:08,053 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 02:38:08,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:38:08,057 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1566 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:08,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 1524 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:38:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 02:38:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-11 02:38:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 413 states have (on average 1.6731234866828086) internal successors, (691), 429 states have internal predecessors, (691), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 900 transitions. [2024-10-11 02:38:08,192 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 900 transitions. Word has length 92 [2024-10-11 02:38:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:08,193 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 900 transitions. [2024-10-11 02:38:08,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 900 transitions. [2024-10-11 02:38:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:38:08,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:08,195 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:08,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:38:08,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1942701978, now seen corresponding path program 1 times [2024-10-11 02:38:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:08,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705649050] [2024-10-11 02:38:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:38:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 02:38:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:38:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:38:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:38:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:38:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705649050] [2024-10-11 02:38:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705649050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173417159] [2024-10-11 02:38:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:08,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:08,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:08,871 INFO L87 Difference]: Start difference. First operand 544 states and 900 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:15,134 INFO L93 Difference]: Finished difference Result 1411 states and 2412 transitions. [2024-10-11 02:38:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 93 [2024-10-11 02:38:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:15,140 INFO L225 Difference]: With dead ends: 1411 [2024-10-11 02:38:15,140 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 02:38:15,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:15,145 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1574 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 5309 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 5782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 5309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:15,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 2870 Invalid, 5782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 5309 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:38:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 02:38:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-11 02:38:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6658476658476657) internal successors, (678), 423 states have internal predecessors, (678), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 887 transitions. [2024-10-11 02:38:15,282 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 887 transitions. Word has length 93 [2024-10-11 02:38:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 887 transitions. [2024-10-11 02:38:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 887 transitions. [2024-10-11 02:38:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:38:15,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:15,286 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:15,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:38:15,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 844398929, now seen corresponding path program 1 times [2024-10-11 02:38:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710754684] [2024-10-11 02:38:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:38:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:38:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:38:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:38:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:38:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:38:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:15,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710754684] [2024-10-11 02:38:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710754684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:15,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628239904] [2024-10-11 02:38:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:15,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:15,900 INFO L87 Difference]: Start difference. First operand 538 states and 887 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:20,535 INFO L93 Difference]: Finished difference Result 1383 states and 2365 transitions. [2024-10-11 02:38:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:38:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-11 02:38:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:20,541 INFO L225 Difference]: With dead ends: 1383 [2024-10-11 02:38:20,541 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 02:38:20,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:38:20,545 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1002 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:20,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1559 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:38:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 02:38:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-11 02:38:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6633906633906634) internal successors, (677), 423 states have internal predecessors, (677), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 886 transitions. [2024-10-11 02:38:20,706 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 886 transitions. Word has length 94 [2024-10-11 02:38:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 886 transitions. [2024-10-11 02:38:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:38:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 886 transitions. [2024-10-11 02:38:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:38:20,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:20,711 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:20,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:38:20,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash -144341603, now seen corresponding path program 1 times [2024-10-11 02:38:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315872996] [2024-10-11 02:38:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:38:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:38:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:38:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315872996] [2024-10-11 02:38:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315872996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204996791] [2024-10-11 02:38:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:21,276 INFO L87 Difference]: Start difference. First operand 538 states and 886 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:27,192 INFO L93 Difference]: Finished difference Result 1393 states and 2374 transitions. [2024-10-11 02:38:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:27,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2024-10-11 02:38:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:27,198 INFO L225 Difference]: With dead ends: 1393 [2024-10-11 02:38:27,198 INFO L226 Difference]: Without dead ends: 865 [2024-10-11 02:38:27,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:27,202 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1489 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 5240 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 5704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 5240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:27,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2912 Invalid, 5704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 5240 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:38:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-10-11 02:38:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 543. [2024-10-11 02:38:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 412 states have (on average 1.6553398058252426) internal successors, (682), 428 states have internal predecessors, (682), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 891 transitions. [2024-10-11 02:38:27,332 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 891 transitions. Word has length 95 [2024-10-11 02:38:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:27,332 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 891 transitions. [2024-10-11 02:38:27,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 891 transitions. [2024-10-11 02:38:27,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:38:27,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:27,335 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:27,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:38:27,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:27,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1214636802, now seen corresponding path program 1 times [2024-10-11 02:38:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612851501] [2024-10-11 02:38:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:38:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 02:38:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:38:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:38:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:38:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:38:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612851501] [2024-10-11 02:38:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612851501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26160491] [2024-10-11 02:38:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:27,936 INFO L87 Difference]: Start difference. First operand 543 states and 891 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:34,057 INFO L93 Difference]: Finished difference Result 1404 states and 2384 transitions. [2024-10-11 02:38:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:38:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2024-10-11 02:38:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:34,063 INFO L225 Difference]: With dead ends: 1404 [2024-10-11 02:38:34,064 INFO L226 Difference]: Without dead ends: 849 [2024-10-11 02:38:34,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:38:34,066 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1004 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 5314 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 5584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 5314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:34,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2948 Invalid, 5584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 5314 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 02:38:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-11 02:38:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-11 02:38:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 401 states have (on average 1.653366583541147) internal successors, (663), 417 states have internal predecessors, (663), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 872 transitions. [2024-10-11 02:38:34,183 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 872 transitions. Word has length 95 [2024-10-11 02:38:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:34,183 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 872 transitions. [2024-10-11 02:38:34,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 872 transitions. [2024-10-11 02:38:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:38:34,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:34,187 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:34,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:38:34,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:34,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash 524055958, now seen corresponding path program 1 times [2024-10-11 02:38:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868956157] [2024-10-11 02:38:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:38:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:38:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:38:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:38:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:38:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:34,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868956157] [2024-10-11 02:38:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868956157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323019270] [2024-10-11 02:38:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:34,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:34,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:34,815 INFO L87 Difference]: Start difference. First operand 532 states and 872 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:40,525 INFO L93 Difference]: Finished difference Result 1377 states and 2340 transitions. [2024-10-11 02:38:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:38:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-11 02:38:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:40,531 INFO L225 Difference]: With dead ends: 1377 [2024-10-11 02:38:40,531 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 02:38:40,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:38:40,535 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1500 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 4941 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 5433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 4941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:40,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 2778 Invalid, 5433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 4941 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:38:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 02:38:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-11 02:38:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6437346437346438) internal successors, (669), 423 states have internal predecessors, (669), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 878 transitions. [2024-10-11 02:38:40,665 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 878 transitions. Word has length 96 [2024-10-11 02:38:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:40,666 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 878 transitions. [2024-10-11 02:38:40,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 878 transitions. [2024-10-11 02:38:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:38:40,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:40,669 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:38:40,669 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -692097768, now seen corresponding path program 1 times [2024-10-11 02:38:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:40,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413611542] [2024-10-11 02:38:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:38:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 02:38:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:38:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:38:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:38:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 02:38:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:38:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:38:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:38:41,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:41,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413611542] [2024-10-11 02:38:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413611542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:41,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:38:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616867628] [2024-10-11 02:38:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:41,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:38:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:38:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:38:41,254 INFO L87 Difference]: Start difference. First operand 538 states and 878 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:38:47,446 INFO L93 Difference]: Finished difference Result 1385 states and 2346 transitions. [2024-10-11 02:38:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:38:47,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-11 02:38:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:38:47,452 INFO L225 Difference]: With dead ends: 1385 [2024-10-11 02:38:47,452 INFO L226 Difference]: Without dead ends: 849 [2024-10-11 02:38:47,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:38:47,455 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1496 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 5017 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 5493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 5017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:38:47,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 2728 Invalid, 5493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 5017 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:38:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-11 02:38:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-11 02:38:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 401 states have (on average 1.6508728179551122) internal successors, (662), 417 states have internal predecessors, (662), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 02:38:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 871 transitions. [2024-10-11 02:38:47,591 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 871 transitions. Word has length 96 [2024-10-11 02:38:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:38:47,591 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 871 transitions. [2024-10-11 02:38:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:38:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 871 transitions. [2024-10-11 02:38:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:38:47,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:47,594 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:47,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:38:47,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -876158845, now seen corresponding path program 1 times [2024-10-11 02:38:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180102808] [2024-10-11 02:38:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:47,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat