./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product25.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_spec2_product25.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 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:35:06,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:35:06,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:35:06,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:35:06,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:35:06,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:35:06,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:35:06,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:35:06,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:35:06,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:35:06,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:35:06,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:35:06,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:35:06,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:35:06,869 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:35:06,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:35:06,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:35:06,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:35:06,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:35:06,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:35:06,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:06,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:35:06,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:35:06,871 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 -> 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec [2025-03-16 18:35:07,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:35:07,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:35:07,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:35:07,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:35:07,125 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:35:07,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-03-16 18:35:08,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1fc2666/715b2a67d10f4f16bc2d52a100a37b08/FLAGb4e82fb78 [2025-03-16 18:35:08,562 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:35:08,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-03-16 18:35:08,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1fc2666/715b2a67d10f4f16bc2d52a100a37b08/FLAGb4e82fb78 [2025-03-16 18:35:08,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da1fc2666/715b2a67d10f4f16bc2d52a100a37b08 [2025-03-16 18:35:08,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:35:08,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:35:08,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:08,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:35:08,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:35:08,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:08" (1/1) ... [2025-03-16 18:35:08,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb96fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:08, skipping insertion in model container [2025-03-16 18:35:08,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:35:08" (1/1) ... [2025-03-16 18:35:08,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:35:09,211 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_spec2_product25.cil.c[66231,66244] [2025-03-16 18:35:09,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:09,244 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:35:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-16 18:35:09,250 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [86] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [100] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [286] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1765] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1884] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2546] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2638] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-03-16 18:35:09,251 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3013] [2025-03-16 18:35:09,325 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_spec2_product25.cil.c[66231,66244] [2025-03-16 18:35:09,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:35:09,352 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:35:09,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09 WrapperNode [2025-03-16 18:35:09,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:35:09,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:09,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:35:09,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:35:09,358 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:35:09" (1/1) ... [2025-03-16 18:35:09,380 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:35:09" (1/1) ... [2025-03-16 18:35:09,422 INFO L138 Inliner]: procedures = 91, calls = 334, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 842 [2025-03-16 18:35:09,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:35:09,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:35:09,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:35:09,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:35:09,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,458 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:35:09,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:35:09,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:35:09,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:35:09,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:35:09,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (1/1) ... [2025-03-16 18:35:09,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:35:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:09,519 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:35:09,525 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:35:09,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:35:09,539 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:35:09,539 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:35:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:35:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:35:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:35:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:35:09,540 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:35:09,540 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:35:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:35:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:35:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:35:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:35:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:35:09,541 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:35:09,541 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:35:09,542 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:35:09,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:35:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:35:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:35:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:35:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:35:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:35:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:35:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:35:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:35:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:35:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:35:09,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:35:09,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:35:09,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~17; [2025-03-16 18:35:09,759 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: #res := ~retValue_acc~15; [2025-03-16 18:35:09,762 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: #res := ~retValue_acc~2; [2025-03-16 18:35:10,035 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: #res := ~retValue_acc~10; [2025-03-16 18:35:10,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1190: #res := ~retValue_acc~13; [2025-03-16 18:35:10,103 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1842: #res := ~retValue_acc~16; [2025-03-16 18:35:10,161 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L641-1: isEmpty_#res#1 := isEmpty_~retValue_acc~7#1; [2025-03-16 18:35:10,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1176-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-16 18:35:10,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~3#1; [2025-03-16 18:35:10,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L592-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~5#1; [2025-03-16 18:35:10,320 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~8#1; [2025-03-16 18:35:10,320 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: isIdle_#res#1 := isIdle_~retValue_acc~9#1; [2025-03-16 18:35:10,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: #res := ~retValue_acc~19; [2025-03-16 18:35:10,419 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-16 18:35:10,420 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3360-1: main_#res#1 := main_~retValue_acc~25#1; [2025-03-16 18:35:10,428 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: #res := ~retValue_acc~18; [2025-03-16 18:35:10,429 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: #res := ~retValue_acc~4; [2025-03-16 18:35:10,433 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~20; [2025-03-16 18:35:10,560 INFO L? ?]: Removed 438 outVars from TransFormulas that were not future-live. [2025-03-16 18:35:10,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:35:10,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:35:10,579 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:35:10,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:10 BoogieIcfgContainer [2025-03-16 18:35:10,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:35:10,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:35:10,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:35:10,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:35:10,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:35:08" (1/3) ... [2025-03-16 18:35:10,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8ad4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:10, skipping insertion in model container [2025-03-16 18:35:10,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:35:09" (2/3) ... [2025-03-16 18:35:10,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8ad4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:35:10, skipping insertion in model container [2025-03-16 18:35:10,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:35:10" (3/3) ... [2025-03-16 18:35:10,585 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2025-03-16 18:35:10,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:35:10,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product25.cil.c that has 22 procedures, 532 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:35:10,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:35:10,665 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;@6202e00a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:35:10,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:35:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 532 states, 421 states have (on average 1.7244655581947743) internal successors, (726), 442 states have internal predecessors, (726), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-16 18:35:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 18:35:10,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:10,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:10,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:10,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1971922658, now seen corresponding path program 1 times [2025-03-16 18:35:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016872252] [2025-03-16 18:35:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:10,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 18:35:10,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 18:35:10,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:10,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:11,154 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:35:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016872252] [2025-03-16 18:35:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016872252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205708849] [2025-03-16 18:35:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:11,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:11,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:11,181 INFO L87 Difference]: Start difference. First operand has 532 states, 421 states have (on average 1.7244655581947743) internal successors, (726), 442 states have internal predecessors, (726), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:11,312 INFO L93 Difference]: Finished difference Result 1049 states and 1784 transitions. [2025-03-16 18:35:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-16 18:35:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:11,327 INFO L225 Difference]: With dead ends: 1049 [2025-03-16 18:35:11,327 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:35:11,336 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:35:11,338 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 5 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2642 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:35:11,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2642 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:35:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:35:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.7211538461538463) internal successors, (716), 435 states have internal predecessors, (716), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 887 transitions. [2025-03-16 18:35:11,418 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 887 transitions. Word has length 69 [2025-03-16 18:35:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:11,419 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 887 transitions. [2025-03-16 18:35:11,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 887 transitions. [2025-03-16 18:35:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 18:35:11,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:11,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:35:11,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1265215929, now seen corresponding path program 1 times [2025-03-16 18:35:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066323078] [2025-03-16 18:35:11,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 18:35:11,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 18:35:11,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:11,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:11,601 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:35:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:11,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066323078] [2025-03-16 18:35:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066323078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:11,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811197012] [2025-03-16 18:35:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:11,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:11,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:11,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:11,605 INFO L87 Difference]: Start difference. First operand 525 states and 887 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:11,667 INFO L93 Difference]: Finished difference Result 1037 states and 1756 transitions. [2025-03-16 18:35:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-16 18:35:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:11,674 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:35:11,674 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:35:11,676 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:35:11,677 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 4 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2624 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:35:11,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2624 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:35:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:35:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.71875) internal successors, (715), 435 states have internal predecessors, (715), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 886 transitions. [2025-03-16 18:35:11,701 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 886 transitions. Word has length 71 [2025-03-16 18:35:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 886 transitions. [2025-03-16 18:35:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 886 transitions. [2025-03-16 18:35:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 18:35:11,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:11,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:11,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:35:11,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1684953753, now seen corresponding path program 1 times [2025-03-16 18:35:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437655641] [2025-03-16 18:35:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:11,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 18:35:11,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 18:35:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:11,881 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:35:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437655641] [2025-03-16 18:35:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437655641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183408160] [2025-03-16 18:35:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:11,883 INFO L87 Difference]: Start difference. First operand 525 states and 886 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:11,940 INFO L93 Difference]: Finished difference Result 1037 states and 1755 transitions. [2025-03-16 18:35:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-16 18:35:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:11,944 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:35:11,944 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:35:11,946 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:35:11,946 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 3 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2624 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:35:11,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2624 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:35:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:35:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.7163461538461537) internal successors, (714), 435 states have internal predecessors, (714), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 885 transitions. [2025-03-16 18:35:11,969 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 885 transitions. Word has length 72 [2025-03-16 18:35:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:11,969 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 885 transitions. [2025-03-16 18:35:11,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 885 transitions. [2025-03-16 18:35:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 18:35:11,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:11,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:11,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:35:11,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:11,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1966229814, now seen corresponding path program 1 times [2025-03-16 18:35:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:11,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727653696] [2025-03-16 18:35:11,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:11,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:11,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 18:35:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 18:35:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:12,110 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:35:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727653696] [2025-03-16 18:35:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727653696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:12,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928750368] [2025-03-16 18:35:12,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:12,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:12,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:12,111 INFO L87 Difference]: Start difference. First operand 525 states and 885 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:12,161 INFO L93 Difference]: Finished difference Result 1037 states and 1754 transitions. [2025-03-16 18:35:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-16 18:35:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:12,166 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:35:12,166 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:35:12,169 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:35:12,170 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 2 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2624 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:35:12,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2624 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:35:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:35:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.7139423076923077) internal successors, (713), 435 states have internal predecessors, (713), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 884 transitions. [2025-03-16 18:35:12,197 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 884 transitions. Word has length 73 [2025-03-16 18:35:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:12,198 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 884 transitions. [2025-03-16 18:35:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 884 transitions. [2025-03-16 18:35:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 18:35:12,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:12,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:35:12,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:12,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2044808778, now seen corresponding path program 1 times [2025-03-16 18:35:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:12,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695328813] [2025-03-16 18:35:12,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:12,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 18:35:12,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 18:35:12,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:12,302 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:35:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695328813] [2025-03-16 18:35:12,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695328813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:12,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514241568] [2025-03-16 18:35:12,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:12,305 INFO L87 Difference]: Start difference. First operand 525 states and 884 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:12,344 INFO L93 Difference]: Finished difference Result 1037 states and 1753 transitions. [2025-03-16 18:35:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-16 18:35:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:12,349 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:35:12,349 INFO L226 Difference]: Without dead ends: 525 [2025-03-16 18:35:12,352 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:35:12,353 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 1 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2624 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:35:12,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2624 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-16 18:35:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-16 18:35:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.7115384615384615) internal successors, (712), 435 states have internal predecessors, (712), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 883 transitions. [2025-03-16 18:35:12,374 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 883 transitions. Word has length 74 [2025-03-16 18:35:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:12,375 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 883 transitions. [2025-03-16 18:35:12,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 883 transitions. [2025-03-16 18:35:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 18:35:12,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:12,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:12,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:35:12,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1678648141, now seen corresponding path program 1 times [2025-03-16 18:35:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787251322] [2025-03-16 18:35:12,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:12,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 18:35:12,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 18:35:12,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:12,557 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:35:12,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787251322] [2025-03-16 18:35:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787251322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:12,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684759586] [2025-03-16 18:35:12,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:12,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:12,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:12,558 INFO L87 Difference]: Start difference. First operand 525 states and 883 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:12,650 INFO L93 Difference]: Finished difference Result 1003 states and 1685 transitions. [2025-03-16 18:35:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-16 18:35:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:12,655 INFO L225 Difference]: With dead ends: 1003 [2025-03-16 18:35:12,655 INFO L226 Difference]: Without dead ends: 540 [2025-03-16 18:35:12,657 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:35:12,658 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 91 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5157 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:12,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5157 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-16 18:35:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2025-03-16 18:35:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 426 states have (on average 1.7065727699530517) internal successors, (727), 447 states have internal predecessors, (727), 89 states have call successors, (89), 21 states have call predecessors, (89), 22 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2025-03-16 18:35:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 902 transitions. [2025-03-16 18:35:12,679 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 902 transitions. Word has length 75 [2025-03-16 18:35:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:12,679 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 902 transitions. [2025-03-16 18:35:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 902 transitions. [2025-03-16 18:35:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 18:35:12,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:12,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:35:12,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1469949838, now seen corresponding path program 1 times [2025-03-16 18:35:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437752346] [2025-03-16 18:35:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 18:35:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 18:35:12,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:12,749 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:35:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437752346] [2025-03-16 18:35:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437752346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:12,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851669229] [2025-03-16 18:35:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:12,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:12,751 INFO L87 Difference]: Start difference. First operand 538 states and 902 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:12,781 INFO L93 Difference]: Finished difference Result 1055 states and 1779 transitions. [2025-03-16 18:35:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:12,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-16 18:35:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:12,785 INFO L225 Difference]: With dead ends: 1055 [2025-03-16 18:35:12,785 INFO L226 Difference]: Without dead ends: 519 [2025-03-16 18:35:12,787 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:35:12,787 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 0 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2626 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:35:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2626 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-16 18:35:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2025-03-16 18:35:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 410 states have (on average 1.7024390243902439) internal successors, (698), 429 states have internal predecessors, (698), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 869 transitions. [2025-03-16 18:35:12,803 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 869 transitions. Word has length 75 [2025-03-16 18:35:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:12,803 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 869 transitions. [2025-03-16 18:35:12,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 869 transitions. [2025-03-16 18:35:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 18:35:12,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:12,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] [2025-03-16 18:35:12,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:35:12,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:12,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1709536811, now seen corresponding path program 1 times [2025-03-16 18:35:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:12,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643143229] [2025-03-16 18:35:12,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:12,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 18:35:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 18:35:12,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:35:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643143229] [2025-03-16 18:35:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643143229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762096711] [2025-03-16 18:35:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:12,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:12,899 INFO L87 Difference]: Start difference. First operand 519 states and 869 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,051 INFO L93 Difference]: Finished difference Result 1000 states and 1677 transitions. [2025-03-16 18:35:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-16 18:35:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,055 INFO L225 Difference]: With dead ends: 1000 [2025-03-16 18:35:13,055 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 18:35:13,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:35:13,057 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 55 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4101 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:35:13,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4101 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 18:35:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-03-16 18:35:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 410 states have (on average 1.6926829268292682) internal successors, (694), 429 states have internal predecessors, (694), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 865 transitions. [2025-03-16 18:35:13,073 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 865 transitions. Word has length 76 [2025-03-16 18:35:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 865 transitions. [2025-03-16 18:35:13,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 865 transitions. [2025-03-16 18:35:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 18:35:13,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:35:13,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2028584746, now seen corresponding path program 1 times [2025-03-16 18:35:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458590144] [2025-03-16 18:35:13,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 18:35:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 18:35:13,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,182 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:35:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458590144] [2025-03-16 18:35:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458590144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466207607] [2025-03-16 18:35:13,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:13,184 INFO L87 Difference]: Start difference. First operand 519 states and 865 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,321 INFO L93 Difference]: Finished difference Result 1000 states and 1673 transitions. [2025-03-16 18:35:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-03-16 18:35:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,325 INFO L225 Difference]: With dead ends: 1000 [2025-03-16 18:35:13,325 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 18:35:13,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:35:13,328 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 54 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4101 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:35:13,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4101 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 18:35:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-03-16 18:35:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 410 states have (on average 1.6829268292682926) internal successors, (690), 429 states have internal predecessors, (690), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 861 transitions. [2025-03-16 18:35:13,345 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 861 transitions. Word has length 77 [2025-03-16 18:35:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 861 transitions. [2025-03-16 18:35:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 861 transitions. [2025-03-16 18:35:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 18:35:13,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,349 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] [2025-03-16 18:35:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:35:13,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -274748718, now seen corresponding path program 1 times [2025-03-16 18:35:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045829233] [2025-03-16 18:35:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 18:35:13,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 18:35:13,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,446 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:35:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045829233] [2025-03-16 18:35:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045829233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773328686] [2025-03-16 18:35:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:13,448 INFO L87 Difference]: Start difference. First operand 519 states and 861 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,572 INFO L93 Difference]: Finished difference Result 1000 states and 1669 transitions. [2025-03-16 18:35:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-16 18:35:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,576 INFO L225 Difference]: With dead ends: 1000 [2025-03-16 18:35:13,576 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 18:35:13,578 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:35:13,579 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 53 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4083 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:35:13,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4083 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 18:35:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2025-03-16 18:35:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 410 states have (on average 1.673170731707317) internal successors, (686), 429 states have internal predecessors, (686), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 857 transitions. [2025-03-16 18:35:13,594 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 857 transitions. Word has length 78 [2025-03-16 18:35:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,595 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 857 transitions. [2025-03-16 18:35:13,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 857 transitions. [2025-03-16 18:35:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 18:35:13,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,597 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] [2025-03-16 18:35:13,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:35:13,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1558833859, now seen corresponding path program 1 times [2025-03-16 18:35:13,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703416280] [2025-03-16 18:35:13,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 18:35:13,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 18:35:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,712 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:35:13,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703416280] [2025-03-16 18:35:13,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703416280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368182887] [2025-03-16 18:35:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:13,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:13,713 INFO L87 Difference]: Start difference. First operand 519 states and 857 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,766 INFO L93 Difference]: Finished difference Result 991 states and 1651 transitions. [2025-03-16 18:35:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:35:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 78 [2025-03-16 18:35:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,770 INFO L225 Difference]: With dead ends: 991 [2025-03-16 18:35:13,771 INFO L226 Difference]: Without dead ends: 498 [2025-03-16 18:35:13,773 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:35:13,773 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 84 mSDsluCounter, 4157 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5003 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:35:13,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5003 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-16 18:35:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-16 18:35:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 389 states have (on average 1.6760925449871464) internal successors, (652), 408 states have internal predecessors, (652), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 823 transitions. [2025-03-16 18:35:13,786 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 823 transitions. Word has length 78 [2025-03-16 18:35:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 823 transitions. [2025-03-16 18:35:13,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 823 transitions. [2025-03-16 18:35:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 18:35:13,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,789 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] [2025-03-16 18:35:13,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:35:13,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1313980723, now seen corresponding path program 1 times [2025-03-16 18:35:13,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059577217] [2025-03-16 18:35:13,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 18:35:13,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 18:35:13,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:13,881 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:35:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:13,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059577217] [2025-03-16 18:35:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059577217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828059175] [2025-03-16 18:35:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:13,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:13,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:13,882 INFO L87 Difference]: Start difference. First operand 498 states and 823 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:13,945 INFO L93 Difference]: Finished difference Result 970 states and 1617 transitions. [2025-03-16 18:35:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-16 18:35:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:13,950 INFO L225 Difference]: With dead ends: 970 [2025-03-16 18:35:13,950 INFO L226 Difference]: Without dead ends: 498 [2025-03-16 18:35:13,952 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:35:13,953 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 17 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4021 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:35:13,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4021 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-16 18:35:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-16 18:35:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 389 states have (on average 1.673521850899743) internal successors, (651), 408 states have internal predecessors, (651), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 822 transitions. [2025-03-16 18:35:13,969 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 822 transitions. Word has length 79 [2025-03-16 18:35:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:13,969 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 822 transitions. [2025-03-16 18:35:13,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 822 transitions. [2025-03-16 18:35:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 18:35:13,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:13,971 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] [2025-03-16 18:35:13,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:35:13,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:13,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2079373263, now seen corresponding path program 1 times [2025-03-16 18:35:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494185872] [2025-03-16 18:35:13,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 18:35:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 18:35:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,062 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:35:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494185872] [2025-03-16 18:35:14,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494185872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237114579] [2025-03-16 18:35:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:14,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:14,063 INFO L87 Difference]: Start difference. First operand 498 states and 822 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,123 INFO L93 Difference]: Finished difference Result 970 states and 1616 transitions. [2025-03-16 18:35:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:35:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-16 18:35:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,129 INFO L225 Difference]: With dead ends: 970 [2025-03-16 18:35:14,129 INFO L226 Difference]: Without dead ends: 498 [2025-03-16 18:35:14,131 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:35:14,131 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 16 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4021 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:35:14,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4021 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-16 18:35:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-16 18:35:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 389 states have (on average 1.6709511568123394) internal successors, (650), 408 states have internal predecessors, (650), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 821 transitions. [2025-03-16 18:35:14,171 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 821 transitions. Word has length 80 [2025-03-16 18:35:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,172 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 821 transitions. [2025-03-16 18:35:14,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 821 transitions. [2025-03-16 18:35:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 18:35:14,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,175 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] [2025-03-16 18:35:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:35:14,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1203841648, now seen corresponding path program 1 times [2025-03-16 18:35:14,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367585019] [2025-03-16 18:35:14,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 18:35:14,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 18:35:14,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,255 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:35:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367585019] [2025-03-16 18:35:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367585019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058966389] [2025-03-16 18:35:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:14,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:14,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:14,256 INFO L87 Difference]: Start difference. First operand 498 states and 821 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:14,292 INFO L93 Difference]: Finished difference Result 964 states and 1604 transitions. [2025-03-16 18:35:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:35:14,293 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-03-16 18:35:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:14,297 INFO L225 Difference]: With dead ends: 964 [2025-03-16 18:35:14,297 INFO L226 Difference]: Without dead ends: 498 [2025-03-16 18:35:14,299 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:35:14,300 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 5 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:14,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2417 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-16 18:35:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-16 18:35:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 389 states have (on average 1.6683804627249357) internal successors, (649), 408 states have internal predecessors, (649), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-16 18:35:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 820 transitions. [2025-03-16 18:35:14,316 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 820 transitions. Word has length 81 [2025-03-16 18:35:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:14,316 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 820 transitions. [2025-03-16 18:35:14,316 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:35:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 820 transitions. [2025-03-16 18:35:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 18:35:14,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:14,319 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] [2025-03-16 18:35:14,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:35:14,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:14,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1877846684, now seen corresponding path program 1 times [2025-03-16 18:35:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482973] [2025-03-16 18:35:14,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 18:35:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 18:35:14,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:14,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:14,512 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:35:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482973] [2025-03-16 18:35:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:35:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529392375] [2025-03-16 18:35:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:35:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:14,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:35:14,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:14,513 INFO L87 Difference]: Start difference. First operand 498 states and 820 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:15,876 INFO L93 Difference]: Finished difference Result 960 states and 1616 transitions. [2025-03-16 18:35:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:35:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-03-16 18:35:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:15,880 INFO L225 Difference]: With dead ends: 960 [2025-03-16 18:35:15,880 INFO L226 Difference]: Without dead ends: 502 [2025-03-16 18:35:15,882 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:35:15,882 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1274 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:15,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1554 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 18:35:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-16 18:35:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-03-16 18:35:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 392 states have (on average 1.663265306122449) internal successors, (652), 411 states have internal predecessors, (652), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (99), 82 states have call predecessors, (99), 83 states have call successors, (99) [2025-03-16 18:35:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 839 transitions. [2025-03-16 18:35:15,900 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 839 transitions. Word has length 82 [2025-03-16 18:35:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:15,900 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 839 transitions. [2025-03-16 18:35:15,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:35:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 839 transitions. [2025-03-16 18:35:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 18:35:15,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:15,901 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] [2025-03-16 18:35:15,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:35:15,902 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 65746113, now seen corresponding path program 1 times [2025-03-16 18:35:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445865268] [2025-03-16 18:35:15,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 18:35:15,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 18:35:15,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:15,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:16,002 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:35:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445865268] [2025-03-16 18:35:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445865268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436423230] [2025-03-16 18:35:16,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:16,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:16,003 INFO L87 Difference]: Start difference. First operand 502 states and 839 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:18,611 INFO L93 Difference]: Finished difference Result 1811 states and 3114 transitions. [2025-03-16 18:35:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:35:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-03-16 18:35:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:18,622 INFO L225 Difference]: With dead ends: 1811 [2025-03-16 18:35:18,622 INFO L226 Difference]: Without dead ends: 1349 [2025-03-16 18:35:18,625 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:35:18,626 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2303 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 4652 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2372 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 4652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:18,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2372 Valid, 2545 Invalid, 5228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 4652 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 18:35:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-03-16 18:35:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1292. [2025-03-16 18:35:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1008 states have (on average 1.6716269841269842) internal successors, (1685), 1056 states have internal predecessors, (1685), 229 states have call successors, (229), 54 states have call predecessors, (229), 54 states have return successors, (244), 218 states have call predecessors, (244), 224 states have call successors, (244) [2025-03-16 18:35:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2158 transitions. [2025-03-16 18:35:18,689 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2158 transitions. Word has length 83 [2025-03-16 18:35:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:18,689 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 2158 transitions. [2025-03-16 18:35:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2158 transitions. [2025-03-16 18:35:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:35:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:18,691 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:35:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:35:18,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1690489858, now seen corresponding path program 1 times [2025-03-16 18:35:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995671010] [2025-03-16 18:35:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:18,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:35:18,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:35:18,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:18,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:18,807 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:35:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995671010] [2025-03-16 18:35:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995671010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730625991] [2025-03-16 18:35:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:18,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:18,809 INFO L87 Difference]: Start difference. First operand 1292 states and 2158 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:21,735 INFO L93 Difference]: Finished difference Result 6115 states and 10531 transitions. [2025-03-16 18:35:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:35:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2025-03-16 18:35:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:21,771 INFO L225 Difference]: With dead ends: 6115 [2025-03-16 18:35:21,771 INFO L226 Difference]: Without dead ends: 4863 [2025-03-16 18:35:21,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:35:21,780 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 3080 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 5249 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3211 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 6066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 5249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:21,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3211 Valid, 2795 Invalid, 6066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [817 Valid, 5249 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 18:35:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2025-03-16 18:35:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 4338. [2025-03-16 18:35:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3217 states have (on average 1.6661485856387939) internal successors, (5360), 3429 states have internal predecessors, (5360), 958 states have call successors, (958), 146 states have call predecessors, (958), 162 states have return successors, (1152), 936 states have call predecessors, (1152), 953 states have call successors, (1152) [2025-03-16 18:35:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 7470 transitions. [2025-03-16 18:35:22,018 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 7470 transitions. Word has length 85 [2025-03-16 18:35:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:22,018 INFO L471 AbstractCegarLoop]: Abstraction has 4338 states and 7470 transitions. [2025-03-16 18:35:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 7470 transitions. [2025-03-16 18:35:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:35:22,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:22,020 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:35:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:35:22,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:22,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1575118140, now seen corresponding path program 1 times [2025-03-16 18:35:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931743528] [2025-03-16 18:35:22,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:22,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:35:22,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:35:22,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:22,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:22,142 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:35:22,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:22,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931743528] [2025-03-16 18:35:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931743528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313740970] [2025-03-16 18:35:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:22,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:22,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:22,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:22,143 INFO L87 Difference]: Start difference. First operand 4338 states and 7470 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:24,135 INFO L93 Difference]: Finished difference Result 11739 states and 20348 transitions. [2025-03-16 18:35:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:35:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2025-03-16 18:35:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:24,196 INFO L225 Difference]: With dead ends: 11739 [2025-03-16 18:35:24,196 INFO L226 Difference]: Without dead ends: 8587 [2025-03-16 18:35:24,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:35:24,219 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 2337 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 4022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:24,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 1675 Invalid, 4022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:35:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2025-03-16 18:35:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 8080. [2025-03-16 18:35:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8080 states, 6032 states have (on average 1.6639588859416445) internal successors, (10037), 6422 states have internal predecessors, (10037), 1720 states have call successors, (1720), 269 states have call predecessors, (1720), 327 states have return successors, (2193), 1679 states have call predecessors, (2193), 1715 states have call successors, (2193) [2025-03-16 18:35:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8080 states to 8080 states and 13950 transitions. [2025-03-16 18:35:24,612 INFO L78 Accepts]: Start accepts. Automaton has 8080 states and 13950 transitions. Word has length 85 [2025-03-16 18:35:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:24,612 INFO L471 AbstractCegarLoop]: Abstraction has 8080 states and 13950 transitions. [2025-03-16 18:35:24,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:35:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 8080 states and 13950 transitions. [2025-03-16 18:35:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:35:24,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:24,615 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:35:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:35:24,615 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 884113350, now seen corresponding path program 1 times [2025-03-16 18:35:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970741741] [2025-03-16 18:35:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:35:24,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:35:24,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:24,715 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:35:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:24,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970741741] [2025-03-16 18:35:24,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970741741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:24,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:24,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:35:24,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520543510] [2025-03-16 18:35:24,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:24,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:35:24,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:24,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:35:24,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:24,717 INFO L87 Difference]: Start difference. First operand 8080 states and 13950 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 18:35:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:25,022 INFO L93 Difference]: Finished difference Result 14896 states and 25782 transitions. [2025-03-16 18:35:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:25,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-16 18:35:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:25,083 INFO L225 Difference]: With dead ends: 14896 [2025-03-16 18:35:25,084 INFO L226 Difference]: Without dead ends: 8167 [2025-03-16 18:35:25,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:25,113 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 0 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:25,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3242 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2025-03-16 18:35:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8153. [2025-03-16 18:35:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8153 states, 6088 states have (on average 1.657358738501971) internal successors, (10090), 6477 states have internal predecessors, (10090), 1717 states have call successors, (1717), 269 states have call predecessors, (1717), 347 states have return successors, (2256), 1697 states have call predecessors, (2256), 1712 states have call successors, (2256) [2025-03-16 18:35:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8153 states to 8153 states and 14063 transitions. [2025-03-16 18:35:25,457 INFO L78 Accepts]: Start accepts. Automaton has 8153 states and 14063 transitions. Word has length 90 [2025-03-16 18:35:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:25,458 INFO L471 AbstractCegarLoop]: Abstraction has 8153 states and 14063 transitions. [2025-03-16 18:35:25,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 18:35:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8153 states and 14063 transitions. [2025-03-16 18:35:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:35:25,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:25,461 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:35:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:35:25,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 66303318, now seen corresponding path program 1 times [2025-03-16 18:35:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087325199] [2025-03-16 18:35:25,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:25,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:35:25,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:35:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:25,688 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:35:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:25,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087325199] [2025-03-16 18:35:25,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087325199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:25,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:25,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:35:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753928472] [2025-03-16 18:35:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:25,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:35:25,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:25,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:35:25,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:35:25,691 INFO L87 Difference]: Start difference. First operand 8153 states and 14063 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-16 18:35:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:26,274 INFO L93 Difference]: Finished difference Result 16122 states and 28255 transitions. [2025-03-16 18:35:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:35:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2025-03-16 18:35:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:26,333 INFO L225 Difference]: With dead ends: 16122 [2025-03-16 18:35:26,333 INFO L226 Difference]: Without dead ends: 8301 [2025-03-16 18:35:26,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:35:26,374 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 244 mSDsluCounter, 5709 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 6565 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:26,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 6565 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2025-03-16 18:35:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 8177. [2025-03-16 18:35:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 6109 states have (on average 1.6354558847601899) internal successors, (9991), 6501 states have internal predecessors, (9991), 1717 states have call successors, (1717), 269 states have call predecessors, (1717), 350 states have return successors, (2268), 1697 states have call predecessors, (2268), 1712 states have call successors, (2268) [2025-03-16 18:35:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 13976 transitions. [2025-03-16 18:35:26,791 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 13976 transitions. Word has length 97 [2025-03-16 18:35:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:26,792 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 13976 transitions. [2025-03-16 18:35:26,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-16 18:35:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 13976 transitions. [2025-03-16 18:35:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:35:26,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:26,794 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:35:26,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:35:26,794 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -488809156, now seen corresponding path program 1 times [2025-03-16 18:35:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:26,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587203295] [2025-03-16 18:35:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:26,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:35:26,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:35:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:35:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587203295] [2025-03-16 18:35:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587203295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:26,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:35:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550013413] [2025-03-16 18:35:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:26,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:35:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:26,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:35:26,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:35:26,917 INFO L87 Difference]: Start difference. First operand 8177 states and 13976 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:28,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:28,760 INFO L93 Difference]: Finished difference Result 15725 states and 26920 transitions. [2025-03-16 18:35:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:35:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2025-03-16 18:35:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:28,806 INFO L225 Difference]: With dead ends: 15725 [2025-03-16 18:35:28,806 INFO L226 Difference]: Without dead ends: 8915 [2025-03-16 18:35:28,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:35:28,832 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1922 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 3548 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 3548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:28,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 2049 Invalid, 3963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 3548 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 18:35:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2025-03-16 18:35:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 8412. [2025-03-16 18:35:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8412 states, 6284 states have (on average 1.6247612985359643) internal successors, (10210), 6694 states have internal predecessors, (10210), 1737 states have call successors, (1737), 294 states have call predecessors, (1737), 390 states have return successors, (2360), 1715 states have call predecessors, (2360), 1732 states have call successors, (2360) [2025-03-16 18:35:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8412 states to 8412 states and 14307 transitions. [2025-03-16 18:35:29,261 INFO L78 Accepts]: Start accepts. Automaton has 8412 states and 14307 transitions. Word has length 102 [2025-03-16 18:35:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 8412 states and 14307 transitions. [2025-03-16 18:35:29,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:35:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 8412 states and 14307 transitions. [2025-03-16 18:35:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 18:35:29,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:29,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:35:29,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1404123185, now seen corresponding path program 1 times [2025-03-16 18:35:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31200412] [2025-03-16 18:35:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:29,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 18:35:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 18:35:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:35:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31200412] [2025-03-16 18:35:29,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31200412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:29,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 18:35:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174744281] [2025-03-16 18:35:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:29,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 18:35:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:29,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 18:35:29,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:29,469 INFO L87 Difference]: Start difference. First operand 8412 states and 14307 transitions. Second operand has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 18:35:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:32,711 INFO L93 Difference]: Finished difference Result 17900 states and 30190 transitions. [2025-03-16 18:35:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 18:35:32,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 109 [2025-03-16 18:35:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:32,788 INFO L225 Difference]: With dead ends: 17900 [2025-03-16 18:35:32,789 INFO L226 Difference]: Without dead ends: 10674 [2025-03-16 18:35:32,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-16 18:35:32,828 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 2064 mSDsluCounter, 4531 mSDsCounter, 0 mSdLazyCounter, 9134 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2149 SdHoareTripleChecker+Valid, 5036 SdHoareTripleChecker+Invalid, 9558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 9134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:32,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2149 Valid, 5036 Invalid, 9558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 9134 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 18:35:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2025-03-16 18:35:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 9886. [2025-03-16 18:35:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9886 states, 7450 states have (on average 1.6012080536912752) internal successors, (11929), 7919 states have internal predecessors, (11929), 1920 states have call successors, (1920), 381 states have call predecessors, (1920), 515 states have return successors, (2633), 1877 states have call predecessors, (2633), 1915 states have call successors, (2633) [2025-03-16 18:35:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9886 states to 9886 states and 16482 transitions. [2025-03-16 18:35:33,465 INFO L78 Accepts]: Start accepts. Automaton has 9886 states and 16482 transitions. Word has length 109 [2025-03-16 18:35:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:33,465 INFO L471 AbstractCegarLoop]: Abstraction has 9886 states and 16482 transitions. [2025-03-16 18:35:33,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-16 18:35:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9886 states and 16482 transitions. [2025-03-16 18:35:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:35:33,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:33,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:35:33,469 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:33,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 512031343, now seen corresponding path program 1 times [2025-03-16 18:35:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216347186] [2025-03-16 18:35:33,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:33,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:35:33,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:35:33,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:33,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:35:33,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:33,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216347186] [2025-03-16 18:35:33,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216347186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:33,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:33,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:35:33,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188023653] [2025-03-16 18:35:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:33,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:35:33,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:33,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:35:33,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:35:33,619 INFO L87 Difference]: Start difference. First operand 9886 states and 16482 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:35:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:34,378 INFO L93 Difference]: Finished difference Result 10009 states and 16699 transitions. [2025-03-16 18:35:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:34,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-16 18:35:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:34,436 INFO L225 Difference]: With dead ends: 10009 [2025-03-16 18:35:34,436 INFO L226 Difference]: Without dead ends: 9994 [2025-03-16 18:35:34,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:34,445 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 883 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:34,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2871 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:35:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9994 states. [2025-03-16 18:35:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9994 to 9894. [2025-03-16 18:35:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9894 states, 7458 states have (on average 1.6005631536604987) internal successors, (11937), 7927 states have internal predecessors, (11937), 1920 states have call successors, (1920), 381 states have call predecessors, (1920), 515 states have return successors, (2633), 1877 states have call predecessors, (2633), 1915 states have call successors, (2633) [2025-03-16 18:35:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 16490 transitions. [2025-03-16 18:35:34,825 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 16490 transitions. Word has length 107 [2025-03-16 18:35:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 9894 states and 16490 transitions. [2025-03-16 18:35:34,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:35:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 16490 transitions. [2025-03-16 18:35:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 18:35:34,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:34,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:34,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:35:34,829 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1933429011, now seen corresponding path program 1 times [2025-03-16 18:35:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996997405] [2025-03-16 18:35:34,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 18:35:34,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 18:35:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:35:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996997405] [2025-03-16 18:35:35,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996997405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:35,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:35,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:35:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016694033] [2025-03-16 18:35:35,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:35,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:35:35,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:35,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:35:35,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:35:35,054 INFO L87 Difference]: Start difference. First operand 9894 states and 16490 transitions. Second operand has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:35:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:35,348 INFO L93 Difference]: Finished difference Result 9909 states and 16508 transitions. [2025-03-16 18:35:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:35:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-16 18:35:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:35,398 INFO L225 Difference]: With dead ends: 9909 [2025-03-16 18:35:35,398 INFO L226 Difference]: Without dead ends: 9894 [2025-03-16 18:35:35,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:35:35,407 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 19 mSDsluCounter, 6372 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7173 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:35:35,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7173 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:35:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2025-03-16 18:35:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9894. [2025-03-16 18:35:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9894 states, 7458 states have (on average 1.5997586484312147) internal successors, (11931), 7927 states have internal predecessors, (11931), 1920 states have call successors, (1920), 381 states have call predecessors, (1920), 515 states have return successors, (2633), 1877 states have call predecessors, (2633), 1915 states have call successors, (2633) [2025-03-16 18:35:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 16484 transitions. [2025-03-16 18:35:35,809 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 16484 transitions. Word has length 113 [2025-03-16 18:35:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:35,809 INFO L471 AbstractCegarLoop]: Abstraction has 9894 states and 16484 transitions. [2025-03-16 18:35:35,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:35:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 16484 transitions. [2025-03-16 18:35:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 18:35:35,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:35,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:35,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:35:35,812 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 340636032, now seen corresponding path program 1 times [2025-03-16 18:35:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926357911] [2025-03-16 18:35:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:35,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 18:35:35,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 18:35:35,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:35,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:35:35,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926357911] [2025-03-16 18:35:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926357911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:35:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568400417] [2025-03-16 18:35:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:35,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:35:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:35,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:35:35,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:35:35,982 INFO L87 Difference]: Start difference. First operand 9894 states and 16484 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:37,231 INFO L93 Difference]: Finished difference Result 19794 states and 33116 transitions. [2025-03-16 18:35:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:35:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-16 18:35:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:37,292 INFO L225 Difference]: With dead ends: 19794 [2025-03-16 18:35:37,292 INFO L226 Difference]: Without dead ends: 9952 [2025-03-16 18:35:37,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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:35:37,328 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1219 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:37,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1545 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 18:35:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9952 states. [2025-03-16 18:35:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9952 to 9894. [2025-03-16 18:35:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9894 states, 7458 states have (on average 1.5989541432019307) internal successors, (11925), 7927 states have internal predecessors, (11925), 1920 states have call successors, (1920), 381 states have call predecessors, (1920), 515 states have return successors, (2633), 1877 states have call predecessors, (2633), 1915 states have call successors, (2633) [2025-03-16 18:35:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9894 states to 9894 states and 16478 transitions. [2025-03-16 18:35:37,807 INFO L78 Accepts]: Start accepts. Automaton has 9894 states and 16478 transitions. Word has length 125 [2025-03-16 18:35:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 9894 states and 16478 transitions. [2025-03-16 18:35:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9894 states and 16478 transitions. [2025-03-16 18:35:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 18:35:37,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:37,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 18:35:37,811 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:37,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2003562024, now seen corresponding path program 1 times [2025-03-16 18:35:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331449660] [2025-03-16 18:35:37,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:37,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 18:35:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 18:35:37,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:37,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:35:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331449660] [2025-03-16 18:35:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331449660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:37,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782507576] [2025-03-16 18:35:37,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:37,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:37,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:37,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:37,915 INFO L87 Difference]: Start difference. First operand 9894 states and 16478 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:39,764 INFO L93 Difference]: Finished difference Result 32411 states and 55557 transitions. [2025-03-16 18:35:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 132 [2025-03-16 18:35:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:39,914 INFO L225 Difference]: With dead ends: 32411 [2025-03-16 18:35:39,914 INFO L226 Difference]: Without dead ends: 22557 [2025-03-16 18:35:39,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:39,958 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1826 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:39,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 906 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 18:35:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2025-03-16 18:35:40,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 21911. [2025-03-16 18:35:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21911 states, 16111 states have (on average 1.5937558190056482) internal successors, (25677), 17224 states have internal predecessors, (25677), 4727 states have call successors, (4727), 757 states have call predecessors, (4727), 1072 states have return successors, (7390), 4663 states have call predecessors, (7390), 4722 states have call successors, (7390) [2025-03-16 18:35:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21911 states to 21911 states and 37794 transitions. [2025-03-16 18:35:41,011 INFO L78 Accepts]: Start accepts. Automaton has 21911 states and 37794 transitions. Word has length 132 [2025-03-16 18:35:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:41,012 INFO L471 AbstractCegarLoop]: Abstraction has 21911 states and 37794 transitions. [2025-03-16 18:35:41,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21911 states and 37794 transitions. [2025-03-16 18:35:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 18:35:41,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:41,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:41,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 18:35:41,019 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:41,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:41,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1980723389, now seen corresponding path program 1 times [2025-03-16 18:35:41,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:41,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881577529] [2025-03-16 18:35:41,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:41,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 18:35:41,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 18:35:41,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:41,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:35:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881577529] [2025-03-16 18:35:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881577529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619272405] [2025-03-16 18:35:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:41,111 INFO L87 Difference]: Start difference. First operand 21911 states and 37794 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:45,030 INFO L93 Difference]: Finished difference Result 73163 states and 131435 transitions. [2025-03-16 18:35:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:45,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2025-03-16 18:35:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:45,389 INFO L225 Difference]: With dead ends: 73163 [2025-03-16 18:35:45,389 INFO L226 Difference]: Without dead ends: 51292 [2025-03-16 18:35:45,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:45,491 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1830 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:45,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 870 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:35:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51292 states. [2025-03-16 18:35:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51292 to 49866. [2025-03-16 18:35:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49866 states, 35649 states have (on average 1.5867766276753905) internal successors, (56567), 38343 states have internal predecessors, (56567), 11973 states have call successors, (11973), 1509 states have call predecessors, (11973), 2243 states have return successors, (21778), 11901 states have call predecessors, (21778), 11968 states have call successors, (21778) [2025-03-16 18:35:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49866 states to 49866 states and 90318 transitions. [2025-03-16 18:35:48,262 INFO L78 Accepts]: Start accepts. Automaton has 49866 states and 90318 transitions. Word has length 133 [2025-03-16 18:35:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:48,262 INFO L471 AbstractCegarLoop]: Abstraction has 49866 states and 90318 transitions. [2025-03-16 18:35:48,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:35:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 49866 states and 90318 transitions. [2025-03-16 18:35:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 18:35:48,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:48,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 18:35:48,268 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1386047809, now seen corresponding path program 1 times [2025-03-16 18:35:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486505776] [2025-03-16 18:35:48,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:48,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 18:35:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 18:35:48,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:35:48,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:48,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486505776] [2025-03-16 18:35:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486505776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226678121] [2025-03-16 18:35:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:48,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:48,351 INFO L87 Difference]: Start difference. First operand 49866 states and 90318 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:35:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:56,607 INFO L93 Difference]: Finished difference Result 169488 states and 324357 transitions. [2025-03-16 18:35:56,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2025-03-16 18:35:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:57,736 INFO L225 Difference]: With dead ends: 169488 [2025-03-16 18:35:57,736 INFO L226 Difference]: Without dead ends: 119662 [2025-03-16 18:35:58,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:35:58,059 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1812 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:58,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 867 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 18:35:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119662 states. [2025-03-16 18:36:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119662 to 116782. [2025-03-16 18:36:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116782 states, 81034 states have (on average 1.5784362119604116) internal successors, (127907), 87676 states have internal predecessors, (127907), 31024 states have call successors, (31024), 3013 states have call predecessors, (31024), 4723 states have return successors, (66211), 31038 states have call predecessors, (66211), 31019 states have call successors, (66211) [2025-03-16 18:36:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116782 states to 116782 states and 225142 transitions. [2025-03-16 18:36:06,359 INFO L78 Accepts]: Start accepts. Automaton has 116782 states and 225142 transitions. Word has length 136 [2025-03-16 18:36:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 116782 states and 225142 transitions. [2025-03-16 18:36:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:36:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 116782 states and 225142 transitions. [2025-03-16 18:36:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 18:36:06,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:06,367 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:36:06,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 18:36:06,367 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:06,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash 17644344, now seen corresponding path program 1 times [2025-03-16 18:36:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573655543] [2025-03-16 18:36:06,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:06,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:06,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 18:36:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 18:36:06,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:06,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:36:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573655543] [2025-03-16 18:36:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573655543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:06,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991741802] [2025-03-16 18:36:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:06,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:06,461 INFO L87 Difference]: Start difference. First operand 116782 states and 225142 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)