./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_product29.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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:37:44,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:37:44,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:37:44,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:37:44,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:37:44,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:37:44,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:37:44,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:37:44,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:37:44,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:37:44,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:37:44,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:37:44,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:37:44,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:37:44,302 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:37:44,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:37:44,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:37:44,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:37:44,304 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:37:44,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:37:44,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:37:44,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:37:44,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:37:44,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:37:44,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:37:44,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:37:44,305 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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2025-03-16 18:37:44,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:37:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:37:44,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:37:44,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:37:44,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:37:44,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-03-16 18:37:45,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4740db889/b8c1d1d12f4d48de90cd76fd36aa9742/FLAG507cac11e [2025-03-16 18:37:46,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:37:46,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-03-16 18:37:46,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4740db889/b8c1d1d12f4d48de90cd76fd36aa9742/FLAG507cac11e [2025-03-16 18:37:46,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4740db889/b8c1d1d12f4d48de90cd76fd36aa9742 [2025-03-16 18:37:46,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:37:46,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:37:46,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:37:46,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:37:46,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:37:46,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67366e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46, skipping insertion in model container [2025-03-16 18:37:46,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:37:46,293 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_product29.cil.c[1700,1713] [2025-03-16 18:37:46,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:37:46,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:37:46,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-16 18:37:46,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2025-03-16 18:37:46,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2025-03-16 18:37:46,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2025-03-16 18:37:46,570 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_product29.cil.c[1700,1713] [2025-03-16 18:37:46,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:37:46,677 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:37:46,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46 WrapperNode [2025-03-16 18:37:46,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:37:46,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:37:46,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:37:46,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:37:46,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,727 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 860 [2025-03-16 18:37:46,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:37:46,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:37:46,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:37:46,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:37:46,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,774 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-16 18:37:46,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:37:46,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:37:46,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:37:46,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:37:46,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (1/1) ... [2025-03-16 18:37:46,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:37:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:46,850 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-16 18:37:46,853 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-16 18:37:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:37:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:37:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:37:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:37:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:37:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:37:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:37:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:37:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-16 18:37:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:37:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:37:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:37:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-16 18:37:46,881 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:37:46,881 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:37:46,881 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:37:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:37:46,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:37:46,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:37:46,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:37:46,882 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:37:46,883 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:37:47,001 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:37:47,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:37:47,059 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: #res := ~retValue_acc~27; [2025-03-16 18:37:47,085 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: #res := ~retValue_acc~25; [2025-03-16 18:37:47,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1829: #res := ~retValue_acc~10; [2025-03-16 18:37:47,101 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: #res := ~retValue_acc~11; [2025-03-16 18:37:47,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~20#1; [2025-03-16 18:37:47,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582: #res#1 := ~retValue_acc~19#1; [2025-03-16 18:37:47,337 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2714: #res := ~retValue_acc~23; [2025-03-16 18:37:47,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3365: #res := ~retValue_acc~26; [2025-03-16 18:37:47,375 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2098: #res := ~retValue_acc~15; [2025-03-16 18:37:47,513 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~18; [2025-03-16 18:37:47,529 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2049: #res := ~retValue_acc~13; [2025-03-16 18:37:47,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2672-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~21#1; [2025-03-16 18:37:47,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2700-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-16 18:37:47,675 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2015-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-16 18:37:47,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2178-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-16 18:37:47,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-16 18:37:47,755 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: #res := ~retValue_acc~1; [2025-03-16 18:37:47,806 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-16 18:37:47,806 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-16 18:37:47,818 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: #res := ~retValue_acc~0; [2025-03-16 18:37:47,821 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L900: #res := ~retValue_acc~2; [2025-03-16 18:37:47,938 INFO L? ?]: Removed 453 outVars from TransFormulas that were not future-live. [2025-03-16 18:37:47,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:37:47,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:37:47,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:37:47,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:37:47 BoogieIcfgContainer [2025-03-16 18:37:47,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:37:47,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:37:47,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:37:47,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:37:47,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:37:46" (1/3) ... [2025-03-16 18:37:47,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437d9b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:37:47, skipping insertion in model container [2025-03-16 18:37:47,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:46" (2/3) ... [2025-03-16 18:37:47,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437d9b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:37:47, skipping insertion in model container [2025-03-16 18:37:47,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:37:47" (3/3) ... [2025-03-16 18:37:47,970 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2025-03-16 18:37:47,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:37:47,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product29.cil.c that has 25 procedures, 554 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:37:48,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:37:48,063 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;@7692dade, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:37:48,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:37:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 554 states, 436 states have (on average 1.7110091743119267) internal successors, (746), 457 states have internal predecessors, (746), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-16 18:37:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:37:48,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:48,085 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:48,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:48,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1001433468, now seen corresponding path program 1 times [2025-03-16 18:37:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552134851] [2025-03-16 18:37:48,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:48,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:37:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:37:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:48,544 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-16 18:37:48,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:48,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552134851] [2025-03-16 18:37:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552134851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098390495] [2025-03-16 18:37:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:48,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:48,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:48,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:48,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:48,568 INFO L87 Difference]: Start difference. First operand has 554 states, 436 states have (on average 1.7110091743119267) internal successors, (746), 457 states have internal predecessors, (746), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:48,684 INFO L93 Difference]: Finished difference Result 1093 states and 1840 transitions. [2025-03-16 18:37:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2025-03-16 18:37:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:48,712 INFO L225 Difference]: With dead ends: 1093 [2025-03-16 18:37:48,713 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 18:37:48,720 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-16 18:37:48,722 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 5 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2726 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-16 18:37:48,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2726 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 18:37:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 18:37:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.7076566125290022) internal successors, (736), 450 states have internal predecessors, (736), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 915 transitions. [2025-03-16 18:37:48,798 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 915 transitions. Word has length 85 [2025-03-16 18:37:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 915 transitions. [2025-03-16 18:37:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 915 transitions. [2025-03-16 18:37:48,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 18:37:48,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:48,806 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:37:48,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:48,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash 431116914, now seen corresponding path program 1 times [2025-03-16 18:37:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126144194] [2025-03-16 18:37:48,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:48,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 18:37:48,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 18:37:48,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:48,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:49,023 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-16 18:37:49,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126144194] [2025-03-16 18:37:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126144194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:49,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576498543] [2025-03-16 18:37:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:49,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:49,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:49,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:49,028 INFO L87 Difference]: Start difference. First operand 547 states and 915 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:49,105 INFO L93 Difference]: Finished difference Result 1081 states and 1812 transitions. [2025-03-16 18:37:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2025-03-16 18:37:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:49,112 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:37:49,113 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 18:37:49,115 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-16 18:37:49,116 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 4 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2708 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-16 18:37:49,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2708 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 18:37:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 18:37:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.705336426914153) internal successors, (735), 450 states have internal predecessors, (735), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 914 transitions. [2025-03-16 18:37:49,144 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 914 transitions. Word has length 87 [2025-03-16 18:37:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:49,145 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 914 transitions. [2025-03-16 18:37:49,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 914 transitions. [2025-03-16 18:37:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 18:37:49,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:49,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:49,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:37:49,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:49,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1232578232, now seen corresponding path program 1 times [2025-03-16 18:37:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670013452] [2025-03-16 18:37:49,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:49,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 18:37:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 18:37:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:49,311 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-16 18:37:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670013452] [2025-03-16 18:37:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670013452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:49,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102669506] [2025-03-16 18:37:49,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:49,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:49,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:49,315 INFO L87 Difference]: Start difference. First operand 547 states and 914 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:49,374 INFO L93 Difference]: Finished difference Result 1081 states and 1811 transitions. [2025-03-16 18:37:49,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:49,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 88 [2025-03-16 18:37:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:49,380 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:37:49,381 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 18:37:49,383 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-16 18:37:49,384 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 3 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2708 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-16 18:37:49,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2708 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 18:37:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 18:37:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.703016241299304) internal successors, (734), 450 states have internal predecessors, (734), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 913 transitions. [2025-03-16 18:37:49,408 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 913 transitions. Word has length 88 [2025-03-16 18:37:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:49,409 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 913 transitions. [2025-03-16 18:37:49,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 913 transitions. [2025-03-16 18:37:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:37:49,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:49,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, 1, 1, 1, 1, 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-16 18:37:49,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:37:49,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:49,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1570697653, now seen corresponding path program 1 times [2025-03-16 18:37:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:49,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670040845] [2025-03-16 18:37:49,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:49,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:37:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:37:49,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:49,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:49,538 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-16 18:37:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670040845] [2025-03-16 18:37:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670040845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339447274] [2025-03-16 18:37:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:49,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:49,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:49,539 INFO L87 Difference]: Start difference. First operand 547 states and 913 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:49,593 INFO L93 Difference]: Finished difference Result 1081 states and 1810 transitions. [2025-03-16 18:37:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:49,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-03-16 18:37:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:49,597 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:37:49,597 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 18:37:49,599 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-16 18:37:49,600 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 2 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2708 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-16 18:37:49,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2708 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 18:37:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 18:37:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.7006960556844548) internal successors, (733), 450 states have internal predecessors, (733), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 912 transitions. [2025-03-16 18:37:49,623 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 912 transitions. Word has length 89 [2025-03-16 18:37:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:49,624 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 912 transitions. [2025-03-16 18:37:49,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 912 transitions. [2025-03-16 18:37:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:37:49,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:49,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:49,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:37:49,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:49,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 430120155, now seen corresponding path program 1 times [2025-03-16 18:37:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:49,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117870282] [2025-03-16 18:37:49,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:37:49,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:37:49,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:49,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:49,758 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-16 18:37:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:49,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117870282] [2025-03-16 18:37:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117870282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943043234] [2025-03-16 18:37:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:49,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:49,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:49,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:49,759 INFO L87 Difference]: Start difference. First operand 547 states and 912 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:49,793 INFO L93 Difference]: Finished difference Result 1081 states and 1809 transitions. [2025-03-16 18:37:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-16 18:37:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:49,798 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:37:49,799 INFO L226 Difference]: Without dead ends: 547 [2025-03-16 18:37:49,800 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-16 18:37:49,802 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 1 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2708 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-16 18:37:49,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-16 18:37:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-16 18:37:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.6983758700696057) internal successors, (732), 450 states have internal predecessors, (732), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 911 transitions. [2025-03-16 18:37:49,828 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 911 transitions. Word has length 90 [2025-03-16 18:37:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:49,828 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 911 transitions. [2025-03-16 18:37:49,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 911 transitions. [2025-03-16 18:37:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 18:37:49,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:49,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:49,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:37:49,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 694578424, now seen corresponding path program 1 times [2025-03-16 18:37:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059135852] [2025-03-16 18:37:49,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:49,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 18:37:49,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 18:37:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:49,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:50,065 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-16 18:37:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:50,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059135852] [2025-03-16 18:37:50,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059135852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:50,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:50,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:37:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786556387] [2025-03-16 18:37:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:50,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:37:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:37:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:50,066 INFO L87 Difference]: Start difference. First operand 547 states and 911 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:50,199 INFO L93 Difference]: Finished difference Result 1047 states and 1741 transitions. [2025-03-16 18:37:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:37:50,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2025-03-16 18:37:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:50,203 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 18:37:50,203 INFO L226 Difference]: Without dead ends: 562 [2025-03-16 18:37:50,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:50,206 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 91 mSDsluCounter, 6210 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7109 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:50,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7109 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-16 18:37:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 560. [2025-03-16 18:37:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 441 states have (on average 1.6938775510204083) internal successors, (747), 462 states have internal predecessors, (747), 93 states have call successors, (93), 24 states have call predecessors, (93), 25 states have return successors, (90), 86 states have call predecessors, (90), 88 states have call successors, (90) [2025-03-16 18:37:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 930 transitions. [2025-03-16 18:37:50,233 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 930 transitions. Word has length 91 [2025-03-16 18:37:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:50,234 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 930 transitions. [2025-03-16 18:37:50,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 930 transitions. [2025-03-16 18:37:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 18:37:50,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:50,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:50,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:37:50,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash 814698297, now seen corresponding path program 1 times [2025-03-16 18:37:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:50,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53472611] [2025-03-16 18:37:50,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:50,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:50,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 18:37:50,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 18:37:50,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:50,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:50,346 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-16 18:37:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53472611] [2025-03-16 18:37:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53472611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:50,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663337147] [2025-03-16 18:37:50,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:50,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:50,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:50,348 INFO L87 Difference]: Start difference. First operand 560 states and 930 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:50,389 INFO L93 Difference]: Finished difference Result 1099 states and 1835 transitions. [2025-03-16 18:37:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2025-03-16 18:37:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:50,394 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:37:50,394 INFO L226 Difference]: Without dead ends: 541 [2025-03-16 18:37:50,396 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-16 18:37:50,396 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 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-16 18:37:50,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-16 18:37:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-16 18:37:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 425 states have (on average 1.6894117647058824) internal successors, (718), 444 states have internal predecessors, (718), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 897 transitions. [2025-03-16 18:37:50,414 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 897 transitions. Word has length 91 [2025-03-16 18:37:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:50,415 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 897 transitions. [2025-03-16 18:37:50,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 897 transitions. [2025-03-16 18:37:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:37:50,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:50,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:50,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:37:50,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2124020855, now seen corresponding path program 1 times [2025-03-16 18:37:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427228612] [2025-03-16 18:37:50,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:50,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:37:50,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:37:50,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:50,567 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-16 18:37:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427228612] [2025-03-16 18:37:50,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427228612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:50,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:50,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665564733] [2025-03-16 18:37:50,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:50,569 INFO L87 Difference]: Start difference. First operand 541 states and 897 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:50,729 INFO L93 Difference]: Finished difference Result 1044 states and 1733 transitions. [2025-03-16 18:37:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2025-03-16 18:37:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:50,734 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 18:37:50,734 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 18:37:50,736 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-16 18:37:50,737 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 55 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4241 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-16 18:37:50,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4241 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 18:37:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 541. [2025-03-16 18:37:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 425 states have (on average 1.68) internal successors, (714), 444 states have internal predecessors, (714), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 893 transitions. [2025-03-16 18:37:50,758 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 893 transitions. Word has length 92 [2025-03-16 18:37:50,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:50,758 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 893 transitions. [2025-03-16 18:37:50,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 893 transitions. [2025-03-16 18:37:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:37:50,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:50,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:50,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:37:50,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -844867167, now seen corresponding path program 1 times [2025-03-16 18:37:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-03-16 18:37:50,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:50,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:37:50,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:37:50,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:50,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:50,905 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-16 18:37:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:50,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-03-16 18:37:50,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999382380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:50,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:50,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:50,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351585847] [2025-03-16 18:37:50,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:50,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:50,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:50,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:50,907 INFO L87 Difference]: Start difference. First operand 541 states and 893 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,050 INFO L93 Difference]: Finished difference Result 1044 states and 1729 transitions. [2025-03-16 18:37:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2025-03-16 18:37:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:51,055 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 18:37:51,055 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 18:37:51,057 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-16 18:37:51,059 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 54 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4241 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-16 18:37:51,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4241 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 18:37:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 541. [2025-03-16 18:37:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 425 states have (on average 1.6705882352941177) internal successors, (710), 444 states have internal predecessors, (710), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 889 transitions. [2025-03-16 18:37:51,076 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 889 transitions. Word has length 93 [2025-03-16 18:37:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:51,076 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 889 transitions. [2025-03-16 18:37:51,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 889 transitions. [2025-03-16 18:37:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 18:37:51,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:51,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:37:51,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -43799194, now seen corresponding path program 1 times [2025-03-16 18:37:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:51,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-03-16 18:37:51,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:51,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 18:37:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 18:37:51,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:51,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:51,197 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-16 18:37:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-03-16 18:37:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877711800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:51,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206826119] [2025-03-16 18:37:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:51,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:51,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:51,199 INFO L87 Difference]: Start difference. First operand 541 states and 889 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,322 INFO L93 Difference]: Finished difference Result 1044 states and 1725 transitions. [2025-03-16 18:37:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:51,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-16 18:37:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:51,326 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 18:37:51,326 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 18:37:51,327 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-16 18:37:51,328 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 53 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4223 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-16 18:37:51,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4223 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 18:37:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 541. [2025-03-16 18:37:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 425 states have (on average 1.6611764705882353) internal successors, (706), 444 states have internal predecessors, (706), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 885 transitions. [2025-03-16 18:37:51,342 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 885 transitions. Word has length 94 [2025-03-16 18:37:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 885 transitions. [2025-03-16 18:37:51,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 885 transitions. [2025-03-16 18:37:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 18:37:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:51,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:51,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:37:51,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1413081943, now seen corresponding path program 1 times [2025-03-16 18:37:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068823814] [2025-03-16 18:37:51,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:51,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 18:37:51,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 18:37:51,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:51,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:51,472 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-16 18:37:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068823814] [2025-03-16 18:37:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068823814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:37:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54045863] [2025-03-16 18:37:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:37:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:51,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:37:51,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:51,474 INFO L87 Difference]: Start difference. First operand 541 states and 885 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,525 INFO L93 Difference]: Finished difference Result 1035 states and 1707 transitions. [2025-03-16 18:37:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:37:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2025-03-16 18:37:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:51,529 INFO L225 Difference]: With dead ends: 1035 [2025-03-16 18:37:51,530 INFO L226 Difference]: Without dead ends: 520 [2025-03-16 18:37:51,531 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-16 18:37:51,532 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 84 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5171 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-16 18:37:51,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5171 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-16 18:37:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-16 18:37:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 404 states have (on average 1.6633663366336633) internal successors, (672), 423 states have internal predecessors, (672), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 851 transitions. [2025-03-16 18:37:51,546 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 851 transitions. Word has length 94 [2025-03-16 18:37:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:51,546 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 851 transitions. [2025-03-16 18:37:51,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 851 transitions. [2025-03-16 18:37:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 18:37:51,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:51,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:51,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:37:51,549 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1178486498, now seen corresponding path program 1 times [2025-03-16 18:37:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570593378] [2025-03-16 18:37:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 18:37:51,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 18:37:51,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:51,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:51,653 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-16 18:37:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570593378] [2025-03-16 18:37:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570593378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70651259] [2025-03-16 18:37:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:51,655 INFO L87 Difference]: Start difference. First operand 520 states and 851 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,719 INFO L93 Difference]: Finished difference Result 1014 states and 1673 transitions. [2025-03-16 18:37:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:51,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2025-03-16 18:37:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:51,723 INFO L225 Difference]: With dead ends: 1014 [2025-03-16 18:37:51,723 INFO L226 Difference]: Without dead ends: 520 [2025-03-16 18:37:51,725 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-16 18:37:51,726 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 17 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4161 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-16 18:37:51,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-16 18:37:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-16 18:37:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 404 states have (on average 1.6608910891089108) internal successors, (671), 423 states have internal predecessors, (671), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 850 transitions. [2025-03-16 18:37:51,741 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 850 transitions. Word has length 95 [2025-03-16 18:37:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:51,741 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 850 transitions. [2025-03-16 18:37:51,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 850 transitions. [2025-03-16 18:37:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 18:37:51,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:51,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:37:51,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2102922051, now seen corresponding path program 1 times [2025-03-16 18:37:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455840668] [2025-03-16 18:37:51,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:51,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 18:37:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 18:37:51,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:51,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:51,853 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-16 18:37:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455840668] [2025-03-16 18:37:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455840668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824783150] [2025-03-16 18:37:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:51,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:51,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:51,854 INFO L87 Difference]: Start difference. First operand 520 states and 850 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,915 INFO L93 Difference]: Finished difference Result 1014 states and 1672 transitions. [2025-03-16 18:37:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-16 18:37:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:51,919 INFO L225 Difference]: With dead ends: 1014 [2025-03-16 18:37:51,919 INFO L226 Difference]: Without dead ends: 520 [2025-03-16 18:37:51,922 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-16 18:37:51,922 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 16 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4161 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-16 18:37:51,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4161 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-16 18:37:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-16 18:37:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 404 states have (on average 1.6584158415841583) internal successors, (670), 423 states have internal predecessors, (670), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 849 transitions. [2025-03-16 18:37:51,936 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 849 transitions. Word has length 96 [2025-03-16 18:37:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:51,936 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 849 transitions. [2025-03-16 18:37:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:37:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 849 transitions. [2025-03-16 18:37:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:37:51,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:51,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:51,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:37:51,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:51,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash 549381275, now seen corresponding path program 1 times [2025-03-16 18:37:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:51,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15230824] [2025-03-16 18:37:51,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:51,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:37:51,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:37:51,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:51,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:52,163 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-16 18:37:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15230824] [2025-03-16 18:37:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15230824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:37:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252086581] [2025-03-16 18:37:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:52,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:37:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:37:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:52,165 INFO L87 Difference]: Start difference. First operand 520 states and 849 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:52,261 INFO L93 Difference]: Finished difference Result 1008 states and 1660 transitions. [2025-03-16 18:37:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:37:52,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-16 18:37:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:52,267 INFO L225 Difference]: With dead ends: 1008 [2025-03-16 18:37:52,267 INFO L226 Difference]: Without dead ends: 520 [2025-03-16 18:37:52,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:52,271 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 6 mSDsluCounter, 6642 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:52,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7475 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-16 18:37:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-16 18:37:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 404 states have (on average 1.6559405940594059) internal successors, (669), 423 states have internal predecessors, (669), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-16 18:37:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 848 transitions. [2025-03-16 18:37:52,289 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 848 transitions. Word has length 97 [2025-03-16 18:37:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:52,289 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 848 transitions. [2025-03-16 18:37:52,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:37:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 848 transitions. [2025-03-16 18:37:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 18:37:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:52,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:52,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:37:52,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1048348944, now seen corresponding path program 1 times [2025-03-16 18:37:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448416304] [2025-03-16 18:37:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:52,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:37:52,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:37:52,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:52,511 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-16 18:37:52,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448416304] [2025-03-16 18:37:52,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448416304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:52,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:52,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:37:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777175123] [2025-03-16 18:37:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:52,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:37:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:52,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:37:52,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:37:52,512 INFO L87 Difference]: Start difference. First operand 520 states and 848 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:37:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:53,940 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2025-03-16 18:37:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:37:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 98 [2025-03-16 18:37:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:53,944 INFO L225 Difference]: With dead ends: 1004 [2025-03-16 18:37:53,945 INFO L226 Difference]: Without dead ends: 524 [2025-03-16 18:37:53,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:37:53,948 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1313 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:53,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 1484 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2769 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 18:37:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-16 18:37:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-16 18:37:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.651105651105651) internal successors, (672), 426 states have internal predecessors, (672), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (103), 86 states have call predecessors, (103), 87 states have call successors, (103) [2025-03-16 18:37:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 867 transitions. [2025-03-16 18:37:53,968 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 867 transitions. Word has length 98 [2025-03-16 18:37:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 867 transitions. [2025-03-16 18:37:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:37:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 867 transitions. [2025-03-16 18:37:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:37:53,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:53,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:37:53,971 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:53,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2045743730, now seen corresponding path program 1 times [2025-03-16 18:37:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467976453] [2025-03-16 18:37:53,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:53,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:37:53,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:37:53,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:53,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:54,104 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-16 18:37:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467976453] [2025-03-16 18:37:54,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467976453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:54,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:37:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790213830] [2025-03-16 18:37:54,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:37:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:54,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:37:54,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:54,105 INFO L87 Difference]: Start difference. First operand 524 states and 867 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:37:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:56,895 INFO L93 Difference]: Finished difference Result 1876 states and 3203 transitions. [2025-03-16 18:37:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:37:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2025-03-16 18:37:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:56,904 INFO L225 Difference]: With dead ends: 1876 [2025-03-16 18:37:56,904 INFO L226 Difference]: Without dead ends: 1392 [2025-03-16 18:37:56,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:37:56,907 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2407 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 4982 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2478 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 5580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 4982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:56,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2478 Valid, 2259 Invalid, 5580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 4982 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 18:37:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-16 18:37:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1332. [2025-03-16 18:37:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1032 states have (on average 1.6560077519379846) internal successors, (1709), 1080 states have internal predecessors, (1709), 236 states have call successors, (236), 63 states have call predecessors, (236), 63 states have return successors, (257), 225 states have call predecessors, (257), 231 states have call successors, (257) [2025-03-16 18:37:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2202 transitions. [2025-03-16 18:37:56,993 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2202 transitions. Word has length 99 [2025-03-16 18:37:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2202 transitions. [2025-03-16 18:37:56,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:37:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2202 transitions. [2025-03-16 18:37:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:37:56,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:56,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:56,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:37:56,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:56,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2052710925, now seen corresponding path program 1 times [2025-03-16 18:37:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305244782] [2025-03-16 18:37:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:57,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:37:57,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:37:57,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:57,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:37:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305244782] [2025-03-16 18:37:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305244782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:57,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:57,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477177131] [2025-03-16 18:37:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:57,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:57,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:57,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:57,107 INFO L87 Difference]: Start difference. First operand 1332 states and 2202 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:37:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:59,387 INFO L93 Difference]: Finished difference Result 4677 states and 7948 transitions. [2025-03-16 18:37:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:37:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 101 [2025-03-16 18:37:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:59,408 INFO L225 Difference]: With dead ends: 4677 [2025-03-16 18:37:59,409 INFO L226 Difference]: Without dead ends: 3386 [2025-03-16 18:37:59,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:59,415 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 3363 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 989 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3397 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 4417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:59,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3397 Valid, 1972 Invalid, 4417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 18:37:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-16 18:37:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3061. [2025-03-16 18:37:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2258 states have (on average 1.6395039858281666) internal successors, (3702), 2404 states have internal predecessors, (3702), 670 states have call successors, (670), 121 states have call predecessors, (670), 132 states have return successors, (771), 657 states have call predecessors, (771), 665 states have call successors, (771) [2025-03-16 18:37:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 5143 transitions. [2025-03-16 18:37:59,582 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 5143 transitions. Word has length 101 [2025-03-16 18:37:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:59,582 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 5143 transitions. [2025-03-16 18:37:59,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:37:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 5143 transitions. [2025-03-16 18:37:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:37:59,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:59,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:59,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:37:59,585 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:59,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2003382650, now seen corresponding path program 1 times [2025-03-16 18:37:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:59,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182440700] [2025-03-16 18:37:59,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:59,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:59,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:37:59,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:37:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:37:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182440700] [2025-03-16 18:37:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182440700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:59,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:59,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480390718] [2025-03-16 18:37:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:59,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:59,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:59,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:59,692 INFO L87 Difference]: Start difference. First operand 3061 states and 5143 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:38:01,928 INFO L93 Difference]: Finished difference Result 11606 states and 20114 transitions. [2025-03-16 18:38:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:38:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 102 [2025-03-16 18:38:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:38:01,982 INFO L225 Difference]: With dead ends: 11606 [2025-03-16 18:38:01,982 INFO L226 Difference]: Without dead ends: 8587 [2025-03-16 18:38:01,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:38:01,998 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 3376 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 3401 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 3401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:38:01,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 1985 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 3401 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 18:38:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2025-03-16 18:38:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 7670. [2025-03-16 18:38:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7670 states, 5337 states have (on average 1.6172006745362564) internal successors, (8631), 5769 states have internal predecessors, (8631), 2047 states have call successors, (2047), 237 states have call predecessors, (2047), 285 states have return successors, (2483), 2042 states have call predecessors, (2483), 2042 states have call successors, (2483) [2025-03-16 18:38:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7670 states to 7670 states and 13161 transitions. [2025-03-16 18:38:02,432 INFO L78 Accepts]: Start accepts. Automaton has 7670 states and 13161 transitions. Word has length 102 [2025-03-16 18:38:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:38:02,433 INFO L471 AbstractCegarLoop]: Abstraction has 7670 states and 13161 transitions. [2025-03-16 18:38:02,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7670 states and 13161 transitions. [2025-03-16 18:38:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:38:02,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:38:02,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:38:02,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:38:02,436 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:38:02,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:38:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1417157032, now seen corresponding path program 1 times [2025-03-16 18:38:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:38:02,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32315380] [2025-03-16 18:38:02,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:38:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:38:02,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:38:02,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:38:02,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:38:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:38:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:38:02,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:38:02,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32315380] [2025-03-16 18:38:02,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32315380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:38:02,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:38:02,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:38:02,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709382455] [2025-03-16 18:38:02,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:38:02,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:38:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:38:02,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:38:02,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:38:02,547 INFO L87 Difference]: Start difference. First operand 7670 states and 13161 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:38:05,377 INFO L93 Difference]: Finished difference Result 31625 states and 56127 transitions. [2025-03-16 18:38:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:38:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 103 [2025-03-16 18:38:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:38:05,539 INFO L225 Difference]: With dead ends: 31625 [2025-03-16 18:38:05,539 INFO L226 Difference]: Without dead ends: 23999 [2025-03-16 18:38:05,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:38:05,584 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 3388 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3424 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:38:05,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3424 Valid, 2006 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:38:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23999 states. [2025-03-16 18:38:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23999 to 21135. [2025-03-16 18:38:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21135 states, 13853 states have (on average 1.5940951418465314) internal successors, (22083), 15172 states have internal predecessors, (22083), 6636 states have call successors, (6636), 469 states have call predecessors, (6636), 645 states have return successors, (8547), 6695 states have call predecessors, (8547), 6631 states have call successors, (8547) [2025-03-16 18:38:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21135 states to 21135 states and 37266 transitions. [2025-03-16 18:38:07,274 INFO L78 Accepts]: Start accepts. Automaton has 21135 states and 37266 transitions. Word has length 103 [2025-03-16 18:38:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:38:07,275 INFO L471 AbstractCegarLoop]: Abstraction has 21135 states and 37266 transitions. [2025-03-16 18:38:07,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21135 states and 37266 transitions. [2025-03-16 18:38:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 18:38:07,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:38:07,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:38:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:38:07,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:38:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:38:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 390126401, now seen corresponding path program 1 times [2025-03-16 18:38:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:38:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978641638] [2025-03-16 18:38:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:38:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:38:07,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 18:38:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 18:38:07,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:38:07,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:38:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:38:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:38:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978641638] [2025-03-16 18:38:07,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978641638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:38:07,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:38:07,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:38:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142080497] [2025-03-16 18:38:07,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:38:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:38:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:38:07,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:38:07,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:38:07,384 INFO L87 Difference]: Start difference. First operand 21135 states and 37266 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:38:13,431 INFO L93 Difference]: Finished difference Result 94186 states and 171643 transitions. [2025-03-16 18:38:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:38:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2025-03-16 18:38:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:38:13,954 INFO L225 Difference]: With dead ends: 94186 [2025-03-16 18:38:13,954 INFO L226 Difference]: Without dead ends: 73099 [2025-03-16 18:38:14,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:38:14,077 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 3400 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3437 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 18:38:14,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3437 Valid, 2027 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3411 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 18:38:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73099 states. [2025-03-16 18:38:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73099 to 63724. [2025-03-16 18:38:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63724 states, 39801 states have (on average 1.5753121780859778) internal successors, (62699), 43983 states have internal predecessors, (62699), 22353 states have call successors, (22353), 933 states have call predecessors, (22353), 1569 states have return successors, (30701), 22732 states have call predecessors, (30701), 22348 states have call successors, (30701) [2025-03-16 18:38:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63724 states to 63724 states and 115753 transitions. [2025-03-16 18:38:19,428 INFO L78 Accepts]: Start accepts. Automaton has 63724 states and 115753 transitions. Word has length 104 [2025-03-16 18:38:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:38:19,429 INFO L471 AbstractCegarLoop]: Abstraction has 63724 states and 115753 transitions. [2025-03-16 18:38:19,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-16 18:38:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63724 states and 115753 transitions. [2025-03-16 18:38:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:38:19,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:38:19,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:38:19,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:38:19,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:38:19,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:38:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1072630461, now seen corresponding path program 1 times [2025-03-16 18:38:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:38:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517718693] [2025-03-16 18:38:19,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:38:19,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:38:19,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:38:19,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:38:19,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:38:19,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:38:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:38:19,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:38:19,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517718693] [2025-03-16 18:38:19,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517718693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:38:19,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:38:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:38:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426967459] [2025-03-16 18:38:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:38:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:38:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:38:19,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:38:19,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:38:19,530 INFO L87 Difference]: Start difference. First operand 63724 states and 115753 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)