./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:52,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:52,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:52,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:52,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:52,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:52,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:52,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:52,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:52,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:52,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:52,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:52,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:52,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:52,966 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:52,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:52,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:52,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:52,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:52,968 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2025-03-03 14:18:53,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:53,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:53,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:53,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:53,198 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:53,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-03-03 14:18:54,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ad01de4/17d44b79af5e45adbe5e2f0cf7bb9b40/FLAG81b5a2480 [2025-03-03 14:18:54,695 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:54,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-03-03 14:18:54,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ad01de4/17d44b79af5e45adbe5e2f0cf7bb9b40/FLAG81b5a2480 [2025-03-03 14:18:54,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ad01de4/17d44b79af5e45adbe5e2f0cf7bb9b40 [2025-03-03 14:18:54,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:54,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:54,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:54,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:54,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:54,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:54" (1/1) ... [2025-03-03 14:18:54,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:54, skipping insertion in model container [2025-03-03 14:18:54,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:54" (1/1) ... [2025-03-03 14:18:54,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:55,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-03-03 14:18:55,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:55,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:55,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:18:55,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2025-03-03 14:18:55,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2025-03-03 14:18:55,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2025-03-03 14:18:55,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2025-03-03 14:18:55,186 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-03-03 14:18:55,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:55,235 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:55,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55 WrapperNode [2025-03-03 14:18:55,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:55,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:55,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:55,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:55,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,315 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 810 [2025-03-03 14:18:55,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:55,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:55,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:55,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:55,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,363 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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]. [2025-03-03 14:18:55,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,380 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:55,397 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:55,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:55,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:55,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (1/1) ... [2025-03-03 14:18:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:55,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:55,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:18:55,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:18:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:55,449 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:18:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:18:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:55,452 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:55,452 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:55,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:55,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:55,454 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:55,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:55,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:55,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:55,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3386: #res := ~retValue_acc~25; [2025-03-03 14:18:55,683 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3308: #res := ~retValue_acc~23; [2025-03-03 14:18:55,687 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: #res := ~retValue_acc~3; [2025-03-03 14:18:55,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1393: #res := ~retValue_acc~11; [2025-03-03 14:18:56,079 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1483-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~13#1; [2025-03-03 14:18:56,080 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L899-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~6#1; [2025-03-03 14:18:56,152 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1497: #res := ~retValue_acc~14; [2025-03-03 14:18:56,161 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: #res := ~retValue_acc~24; [2025-03-03 14:18:56,178 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~8; [2025-03-03 14:18:56,240 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L856-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; [2025-03-03 14:18:56,300 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-03-03 14:18:56,300 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-03-03 14:18:56,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: #res := ~retValue_acc~17; [2025-03-03 14:18:56,403 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142-1: main_#res#1 := main_~retValue_acc~20#1; [2025-03-03 14:18:56,403 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-03 14:18:56,411 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2240: #res := ~retValue_acc~16; [2025-03-03 14:18:56,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: #res := ~retValue_acc~5; [2025-03-03 14:18:56,416 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787: #res := ~retValue_acc~18; [2025-03-03 14:18:56,524 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:56,524 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:56,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:56,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:56,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:56 BoogieIcfgContainer [2025-03-03 14:18:56,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:56,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:56,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:56,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:56,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:54" (1/3) ... [2025-03-03 14:18:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70513df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:56, skipping insertion in model container [2025-03-03 14:18:56,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:55" (2/3) ... [2025-03-03 14:18:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70513df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:56, skipping insertion in model container [2025-03-03 14:18:56,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:56" (3/3) ... [2025-03-03 14:18:56,565 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2025-03-03 14:18:56,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:56,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product26.cil.c that has 24 procedures, 544 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:56,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:56,638 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;@312495e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:56,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 544 states, 430 states have (on average 1.7069767441860466) internal successors, (734), 453 states have internal predecessors, (734), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:18:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 14:18:56,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:56,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:56,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:56,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash -625299868, now seen corresponding path program 1 times [2025-03-03 14:18:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:56,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021468523] [2025-03-03 14:18:56,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:56,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 14:18:56,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 14:18:56,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:56,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:57,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021468523] [2025-03-03 14:18:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021468523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:57,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:57,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749118321] [2025-03-03 14:18:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:57,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:57,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,169 INFO L87 Difference]: Start difference. First operand has 544 states, 430 states have (on average 1.7069767441860466) internal successors, (734), 453 states have internal predecessors, (734), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:57,322 INFO L93 Difference]: Finished difference Result 1068 states and 1799 transitions. [2025-03-03 14:18:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2025-03-03 14:18:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:57,342 INFO L225 Difference]: With dead ends: 1068 [2025-03-03 14:18:57,343 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:18:57,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,353 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 5 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:57,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2672 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:18:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:18:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.705188679245283) internal successors, (723), 445 states have internal predecessors, (723), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 896 transitions. [2025-03-03 14:18:57,409 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 896 transitions. Word has length 58 [2025-03-03 14:18:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:57,409 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 896 transitions. [2025-03-03 14:18:57,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 896 transitions. [2025-03-03 14:18:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:18:57,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:57,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:57,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2047392632, now seen corresponding path program 1 times [2025-03-03 14:18:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321773289] [2025-03-03 14:18:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:18:57,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:18:57,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:57,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321773289] [2025-03-03 14:18:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321773289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911369429] [2025-03-03 14:18:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:57,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:57,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,590 INFO L87 Difference]: Start difference. First operand 536 states and 896 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:57,676 INFO L93 Difference]: Finished difference Result 1054 states and 1769 transitions. [2025-03-03 14:18:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:57,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2025-03-03 14:18:57,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:57,683 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 14:18:57,683 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:18:57,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,686 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 4 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:57,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2651 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:18:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:18:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.7028301886792452) internal successors, (722), 445 states have internal predecessors, (722), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 895 transitions. [2025-03-03 14:18:57,715 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 895 transitions. Word has length 61 [2025-03-03 14:18:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:57,715 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 895 transitions. [2025-03-03 14:18:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 895 transitions. [2025-03-03 14:18:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:18:57,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:57,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:57,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:57,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:57,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash -574622722, now seen corresponding path program 1 times [2025-03-03 14:18:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690804964] [2025-03-03 14:18:57,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:57,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:18:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:18:57,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:57,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690804964] [2025-03-03 14:18:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690804964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608319500] [2025-03-03 14:18:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:57,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:57,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,907 INFO L87 Difference]: Start difference. First operand 536 states and 895 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:57,972 INFO L93 Difference]: Finished difference Result 1054 states and 1768 transitions. [2025-03-03 14:18:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-03 14:18:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:57,979 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 14:18:57,980 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:18:57,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:57,985 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 3 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:57,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2651 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:18:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:18:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.7004716981132075) internal successors, (721), 445 states have internal predecessors, (721), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 894 transitions. [2025-03-03 14:18:58,022 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 894 transitions. Word has length 62 [2025-03-03 14:18:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,023 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 894 transitions. [2025-03-03 14:18:58,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 894 transitions. [2025-03-03 14:18:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:18:58,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:58,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 732379669, now seen corresponding path program 1 times [2025-03-03 14:18:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783605838] [2025-03-03 14:18:58,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:18:58,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:18:58,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:58,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783605838] [2025-03-03 14:18:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783605838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:58,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319098235] [2025-03-03 14:18:58,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:58,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,162 INFO L87 Difference]: Start difference. First operand 536 states and 894 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:58,211 INFO L93 Difference]: Finished difference Result 1054 states and 1767 transitions. [2025-03-03 14:18:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-03 14:18:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:58,218 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 14:18:58,218 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:18:58,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,221 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:58,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2651 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:18:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:18:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.6981132075471699) internal successors, (720), 445 states have internal predecessors, (720), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 893 transitions. [2025-03-03 14:18:58,250 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 893 transitions. Word has length 63 [2025-03-03 14:18:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 893 transitions. [2025-03-03 14:18:58,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 893 transitions. [2025-03-03 14:18:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:18:58,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:58,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash -715119429, now seen corresponding path program 1 times [2025-03-03 14:18:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725053427] [2025-03-03 14:18:58,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:18:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:18:58,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:58,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725053427] [2025-03-03 14:18:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725053427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046067930] [2025-03-03 14:18:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:58,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,384 INFO L87 Difference]: Start difference. First operand 536 states and 893 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:58,426 INFO L93 Difference]: Finished difference Result 1054 states and 1766 transitions. [2025-03-03 14:18:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:58,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:18:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:58,431 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 14:18:58,431 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:18:58,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,435 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2651 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:18:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:18:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 424 states have (on average 1.695754716981132) internal successors, (719), 445 states have internal predecessors, (719), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 892 transitions. [2025-03-03 14:18:58,466 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 892 transitions. Word has length 64 [2025-03-03 14:18:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,467 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 892 transitions. [2025-03-03 14:18:58,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 892 transitions. [2025-03-03 14:18:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:18:58,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:58,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1652818766, now seen corresponding path program 1 times [2025-03-03 14:18:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292844773] [2025-03-03 14:18:58,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:18:58,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:18:58,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292844773] [2025-03-03 14:18:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292844773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243127737] [2025-03-03 14:18:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:58,659 INFO L87 Difference]: Start difference. First operand 536 states and 892 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:18:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:58,759 INFO L93 Difference]: Finished difference Result 1020 states and 1698 transitions. [2025-03-03 14:18:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 14:18:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:58,763 INFO L225 Difference]: With dead ends: 1020 [2025-03-03 14:18:58,763 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:18:58,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:18:58,765 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 91 mSDsluCounter, 4329 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5211 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:58,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5211 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:18:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2025-03-03 14:18:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 434 states have (on average 1.6912442396313363) internal successors, (734), 457 states have internal predecessors, (734), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-03 14:18:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 911 transitions. [2025-03-03 14:18:58,794 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 911 transitions. Word has length 65 [2025-03-03 14:18:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 911 transitions. [2025-03-03 14:18:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:18:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 911 transitions. [2025-03-03 14:18:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:18:58,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:58,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -683237743, now seen corresponding path program 1 times [2025-03-03 14:18:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900572428] [2025-03-03 14:18:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:18:58,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:18:58,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900572428] [2025-03-03 14:18:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900572428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102838485] [2025-03-03 14:18:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:58,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,875 INFO L87 Difference]: Start difference. First operand 549 states and 911 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:58,906 INFO L93 Difference]: Finished difference Result 1072 states and 1792 transitions. [2025-03-03 14:18:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:18:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:58,910 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 14:18:58,910 INFO L226 Difference]: Without dead ends: 530 [2025-03-03 14:18:58,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:58,913 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 0 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:58,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2653 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-03 14:18:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-03 14:18:58,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.686602870813397) internal successors, (705), 439 states have internal predecessors, (705), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 878 transitions. [2025-03-03 14:18:58,929 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 878 transitions. Word has length 65 [2025-03-03 14:18:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,929 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 878 transitions. [2025-03-03 14:18:58,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 878 transitions. [2025-03-03 14:18:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:18:58,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:58,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1169927784, now seen corresponding path program 1 times [2025-03-03 14:18:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628853754] [2025-03-03 14:18:58,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:18:58,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:18:58,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628853754] [2025-03-03 14:18:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628853754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870514626] [2025-03-03 14:18:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:59,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:59,055 INFO L87 Difference]: Start difference. First operand 530 states and 878 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,204 INFO L93 Difference]: Finished difference Result 1017 states and 1690 transitions. [2025-03-03 14:18:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 14:18:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,208 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:18:59,208 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 14:18:59,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:59,210 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 55 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4146 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 14:18:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-03-03 14:18:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.6770334928229664) internal successors, (701), 439 states have internal predecessors, (701), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 874 transitions. [2025-03-03 14:18:59,225 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 874 transitions. Word has length 66 [2025-03-03 14:18:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 874 transitions. [2025-03-03 14:18:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 874 transitions. [2025-03-03 14:18:59,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:18:59,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:59,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1193733129, now seen corresponding path program 1 times [2025-03-03 14:18:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859212784] [2025-03-03 14:18:59,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:18:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:18:59,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859212784] [2025-03-03 14:18:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859212784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314806157] [2025-03-03 14:18:59,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:59,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:59,340 INFO L87 Difference]: Start difference. First operand 530 states and 874 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,482 INFO L93 Difference]: Finished difference Result 1017 states and 1686 transitions. [2025-03-03 14:18:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:18:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,486 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:18:59,486 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 14:18:59,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:59,493 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 54 mSDsluCounter, 3311 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4146 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:59,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 14:18:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-03-03 14:18:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.667464114832536) internal successors, (697), 439 states have internal predecessors, (697), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 870 transitions. [2025-03-03 14:18:59,509 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 870 transitions. Word has length 67 [2025-03-03 14:18:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 870 transitions. [2025-03-03 14:18:59,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 870 transitions. [2025-03-03 14:18:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:59,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:59,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -731029381, now seen corresponding path program 1 times [2025-03-03 14:18:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563094480] [2025-03-03 14:18:59,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:59,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563094480] [2025-03-03 14:18:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563094480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301527421] [2025-03-03 14:18:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:59,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:59,607 INFO L87 Difference]: Start difference. First operand 530 states and 870 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,734 INFO L93 Difference]: Finished difference Result 1017 states and 1682 transitions. [2025-03-03 14:18:59,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:59,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:18:59,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,739 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:18:59,739 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 14:18:59,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:59,741 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 53 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4128 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 14:18:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 530. [2025-03-03 14:18:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.6578947368421053) internal successors, (693), 439 states have internal predecessors, (693), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 866 transitions. [2025-03-03 14:18:59,762 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 866 transitions. Word has length 68 [2025-03-03 14:18:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,762 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 866 transitions. [2025-03-03 14:18:59,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:18:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 866 transitions. [2025-03-03 14:18:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:18:59,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:59,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash 884169898, now seen corresponding path program 1 times [2025-03-03 14:18:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261651241] [2025-03-03 14:18:59,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:18:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:18:59,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261651241] [2025-03-03 14:18:59,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261651241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886781795] [2025-03-03 14:18:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:59,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:59,865 INFO L87 Difference]: Start difference. First operand 530 states and 866 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:18:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,914 INFO L93 Difference]: Finished difference Result 1008 states and 1664 transitions. [2025-03-03 14:18:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2025-03-03 14:18:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,919 INFO L225 Difference]: With dead ends: 1008 [2025-03-03 14:18:59,919 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 14:18:59,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:18:59,922 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 84 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5057 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 14:18:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-03 14:18:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6599496221662469) internal successors, (659), 418 states have internal predecessors, (659), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:18:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 832 transitions. [2025-03-03 14:18:59,935 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 832 transitions. Word has length 68 [2025-03-03 14:18:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,936 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 832 transitions. [2025-03-03 14:18:59,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:18:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 832 transitions. [2025-03-03 14:18:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:18:59,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:18:59,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1842035468, now seen corresponding path program 1 times [2025-03-03 14:18:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313915287] [2025-03-03 14:18:59,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:18:59,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:18:59,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:00,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313915287] [2025-03-03 14:19:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313915287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:00,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659122942] [2025-03-03 14:19:00,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:00,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:00,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:00,027 INFO L87 Difference]: Start difference. First operand 509 states and 832 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,092 INFO L93 Difference]: Finished difference Result 987 states and 1630 transitions. [2025-03-03 14:19:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:00,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:19:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,096 INFO L225 Difference]: With dead ends: 987 [2025-03-03 14:19:00,096 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 14:19:00,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:00,098 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 17 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4066 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 14:19:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-03 14:19:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6574307304785894) internal successors, (658), 418 states have internal predecessors, (658), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:19:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 831 transitions. [2025-03-03 14:19:00,112 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 831 transitions. Word has length 69 [2025-03-03 14:19:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,112 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 831 transitions. [2025-03-03 14:19:00,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 831 transitions. [2025-03-03 14:19:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:19:00,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:00,113 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2113827678, now seen corresponding path program 1 times [2025-03-03 14:19:00,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116752726] [2025-03-03 14:19:00,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:19:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:19:00,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116752726] [2025-03-03 14:19:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116752726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715213287] [2025-03-03 14:19:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:00,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:00,217 INFO L87 Difference]: Start difference. First operand 509 states and 831 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,274 INFO L93 Difference]: Finished difference Result 987 states and 1629 transitions. [2025-03-03 14:19:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:00,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:19:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,279 INFO L225 Difference]: With dead ends: 987 [2025-03-03 14:19:00,279 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 14:19:00,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:00,281 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 16 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4066 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4066 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 14:19:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-03 14:19:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.654911838790932) internal successors, (657), 418 states have internal predecessors, (657), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:19:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 830 transitions. [2025-03-03 14:19:00,296 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 830 transitions. Word has length 70 [2025-03-03 14:19:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 830 transitions. [2025-03-03 14:19:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 830 transitions. [2025-03-03 14:19:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:19:00,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:00,297 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash -234355185, now seen corresponding path program 1 times [2025-03-03 14:19:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263377553] [2025-03-03 14:19:00,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:19:00,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:19:00,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:00,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263377553] [2025-03-03 14:19:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263377553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693994458] [2025-03-03 14:19:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:00,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,361 INFO L87 Difference]: Start difference. First operand 509 states and 830 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,396 INFO L93 Difference]: Finished difference Result 981 states and 1617 transitions. [2025-03-03 14:19:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-03 14:19:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,401 INFO L225 Difference]: With dead ends: 981 [2025-03-03 14:19:00,401 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 14:19:00,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,405 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 5 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2444 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 14:19:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-03 14:19:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 397 states have (on average 1.6523929471032746) internal successors, (656), 418 states have internal predecessors, (656), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:19:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 829 transitions. [2025-03-03 14:19:00,422 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 829 transitions. Word has length 71 [2025-03-03 14:19:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,422 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 829 transitions. [2025-03-03 14:19:00,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:19:00,422 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 829 transitions. [2025-03-03 14:19:00,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:19:00,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:19:00,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2007050865, now seen corresponding path program 1 times [2025-03-03 14:19:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141304995] [2025-03-03 14:19:00,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:19:00,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:19:00,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141304995] [2025-03-03 14:19:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141304995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655385175] [2025-03-03 14:19:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:00,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:00,623 INFO L87 Difference]: Start difference. First operand 509 states and 829 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:04,722 INFO L93 Difference]: Finished difference Result 1651 states and 2792 transitions. [2025-03-03 14:19:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2025-03-03 14:19:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:04,730 INFO L225 Difference]: With dead ends: 1651 [2025-03-03 14:19:04,730 INFO L226 Difference]: Without dead ends: 1187 [2025-03-03 14:19:04,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:19:04,733 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 3284 mSDsluCounter, 5691 mSDsCounter, 0 mSdLazyCounter, 9222 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3321 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 10178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 9222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:04,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3321 Valid, 6531 Invalid, 10178 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [956 Valid, 9222 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 14:19:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-03 14:19:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1139. [2025-03-03 14:19:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 852 states have (on average 1.6514084507042253) internal successors, (1407), 906 states have internal predecessors, (1407), 240 states have call successors, (240), 41 states have call predecessors, (240), 46 states have return successors, (260), 234 states have call predecessors, (260), 235 states have call successors, (260) [2025-03-03 14:19:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1907 transitions. [2025-03-03 14:19:04,782 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1907 transitions. Word has length 72 [2025-03-03 14:19:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:04,783 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1907 transitions. [2025-03-03 14:19:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1907 transitions. [2025-03-03 14:19:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:19:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:04,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:04,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:19:04,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2004451392, now seen corresponding path program 1 times [2025-03-03 14:19:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760148791] [2025-03-03 14:19:04,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:04,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:19:04,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:19:04,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:04,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760148791] [2025-03-03 14:19:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760148791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850471441] [2025-03-03 14:19:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:04,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:04,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:04,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:04,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:04,966 INFO L87 Difference]: Start difference. First operand 1139 states and 1907 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,648 INFO L93 Difference]: Finished difference Result 4051 states and 7020 transitions. [2025-03-03 14:19:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 73 [2025-03-03 14:19:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,672 INFO L225 Difference]: With dead ends: 4051 [2025-03-03 14:19:08,672 INFO L226 Difference]: Without dead ends: 2957 [2025-03-03 14:19:08,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:19:08,683 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3282 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 9226 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 10175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 9226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:08,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 6479 Invalid, 10175 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [949 Valid, 9226 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 14:19:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2025-03-03 14:19:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2878. [2025-03-03 14:19:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2041 states have (on average 1.6320431161195492) internal successors, (3331), 2199 states have internal predecessors, (3331), 728 states have call successors, (728), 77 states have call predecessors, (728), 108 states have return successors, (885), 739 states have call predecessors, (885), 723 states have call successors, (885) [2025-03-03 14:19:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 4944 transitions. [2025-03-03 14:19:08,874 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 4944 transitions. Word has length 73 [2025-03-03 14:19:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,875 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 4944 transitions. [2025-03-03 14:19:08,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 4944 transitions. [2025-03-03 14:19:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:19:08,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:19:08,877 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1679228178, now seen corresponding path program 1 times [2025-03-03 14:19:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896586687] [2025-03-03 14:19:08,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:19:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:19:08,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:09,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896586687] [2025-03-03 14:19:09,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896586687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88248321] [2025-03-03 14:19:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:09,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:09,085 INFO L87 Difference]: Start difference. First operand 2878 states and 4944 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:12,135 INFO L93 Difference]: Finished difference Result 11114 states and 19756 transitions. [2025-03-03 14:19:12,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:12,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-03 14:19:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:12,183 INFO L225 Difference]: With dead ends: 11114 [2025-03-03 14:19:12,184 INFO L226 Difference]: Without dead ends: 8281 [2025-03-03 14:19:12,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:19:12,204 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 4063 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 8613 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 6198 SdHoareTripleChecker+Invalid, 9842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 8613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:12,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4100 Valid, 6198 Invalid, 9842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 8613 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 14:19:12,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2025-03-03 14:19:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 8140. [2025-03-03 14:19:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8140 states, 5463 states have (on average 1.604429800475929) internal successors, (8765), 5961 states have internal predecessors, (8765), 2392 states have call successors, (2392), 149 states have call predecessors, (2392), 284 states have return successors, (3207), 2489 states have call predecessors, (3207), 2387 states have call successors, (3207) [2025-03-03 14:19:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 14364 transitions. [2025-03-03 14:19:12,695 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 14364 transitions. Word has length 74 [2025-03-03 14:19:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 8140 states and 14364 transitions. [2025-03-03 14:19:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 14364 transitions. [2025-03-03 14:19:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:19:12,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:12,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:19:12,699 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 782693533, now seen corresponding path program 1 times [2025-03-03 14:19:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794919382] [2025-03-03 14:19:12,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:12,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:19:12,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:19:12,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:12,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:12,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:12,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794919382] [2025-03-03 14:19:12,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794919382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:12,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:12,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32823727] [2025-03-03 14:19:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:12,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:12,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:12,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:12,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:12,860 INFO L87 Difference]: Start difference. First operand 8140 states and 14364 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,824 INFO L93 Difference]: Finished difference Result 33773 states and 61659 transitions. [2025-03-03 14:19:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2025-03-03 14:19:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,994 INFO L225 Difference]: With dead ends: 33773 [2025-03-03 14:19:16,994 INFO L226 Difference]: Without dead ends: 25678 [2025-03-03 14:19:17,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:19:17,055 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3294 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 9258 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3331 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 10207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 9258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:17,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3331 Valid, 6479 Invalid, 10207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 9258 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 14:19:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25678 states. [2025-03-03 14:19:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25678 to 25413. [2025-03-03 14:19:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25413 states, 16286 states have (on average 1.578226697777232) internal successors, (25703), 17935 states have internal predecessors, (25703), 8290 states have call successors, (8290), 293 states have call predecessors, (8290), 836 states have return successors, (12086), 8766 states have call predecessors, (12086), 8285 states have call successors, (12086) [2025-03-03 14:19:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25413 states to 25413 states and 46079 transitions. [2025-03-03 14:19:18,726 INFO L78 Accepts]: Start accepts. Automaton has 25413 states and 46079 transitions. Word has length 75 [2025-03-03 14:19:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,726 INFO L471 AbstractCegarLoop]: Abstraction has 25413 states and 46079 transitions. [2025-03-03 14:19:18,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25413 states and 46079 transitions. [2025-03-03 14:19:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:19:18,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:19:18,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash 484726635, now seen corresponding path program 1 times [2025-03-03 14:19:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467138787] [2025-03-03 14:19:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:19:18,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:19:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467138787] [2025-03-03 14:19:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467138787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398765998] [2025-03-03 14:19:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:18,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:18,898 INFO L87 Difference]: Start difference. First operand 25413 states and 46079 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:26,069 INFO L93 Difference]: Finished difference Result 111614 states and 209110 transitions. [2025-03-03 14:19:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:26,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 76 [2025-03-03 14:19:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,787 INFO L225 Difference]: With dead ends: 111614 [2025-03-03 14:19:26,787 INFO L226 Difference]: Without dead ends: 86246 [2025-03-03 14:19:27,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:19:27,160 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 4075 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 8641 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 6198 SdHoareTripleChecker+Invalid, 9870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 8641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 6198 Invalid, 9870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 8641 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 14:19:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86246 states. [2025-03-03 14:19:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86246 to 85733. [2025-03-03 14:19:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85733 states, 53266 states have (on average 1.5594375398941163) internal successors, (83065), 58929 states have internal predecessors, (83065), 29742 states have call successors, (29742), 581 states have call predecessors, (29742), 2724 states have return successors, (46624), 31798 states have call predecessors, (46624), 29737 states have call successors, (46624) [2025-03-03 14:19:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85733 states to 85733 states and 159431 transitions. [2025-03-03 14:19:33,296 INFO L78 Accepts]: Start accepts. Automaton has 85733 states and 159431 transitions. Word has length 76 [2025-03-03 14:19:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:33,296 INFO L471 AbstractCegarLoop]: Abstraction has 85733 states and 159431 transitions. [2025-03-03 14:19:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:19:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 85733 states and 159431 transitions. [2025-03-03 14:19:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:19:33,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:33,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:19:33,298 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash 529558778, now seen corresponding path program 1 times [2025-03-03 14:19:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631956385] [2025-03-03 14:19:33,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:33,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:19:33,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:19:33,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:33,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631956385] [2025-03-03 14:19:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631956385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:33,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:19:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034442345] [2025-03-03 14:19:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:19:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:33,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:19:33,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:33,461 INFO L87 Difference]: Start difference. First operand 85733 states and 159431 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)