./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product21.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 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:17:41,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:17:41,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:17:41,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:17:41,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:17:41,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:17:41,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:17:41,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:17:41,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:17:41,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:17:41,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:17:41,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:17:41,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:17:41,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:17:41,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:17:41,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:17:41,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:41,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:17:41,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:17:41,767 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 -> 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 [2025-03-03 14:17:41,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:17:42,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:17:42,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:17:42,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:17:42,006 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:17:42,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2025-03-03 14:17:43,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92cf87bf/3d18766d629448e692435d1937eb7a7d/FLAGd3bf757ef [2025-03-03 14:17:43,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:17:43,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2025-03-03 14:17:43,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92cf87bf/3d18766d629448e692435d1937eb7a7d/FLAGd3bf757ef [2025-03-03 14:17:43,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e92cf87bf/3d18766d629448e692435d1937eb7a7d [2025-03-03 14:17:43,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:17:43,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:17:43,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:43,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:17:43,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:17:43,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:43" (1/1) ... [2025-03-03 14:17:43,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f32dad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:43, skipping insertion in model container [2025-03-03 14:17:43,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:43" (1/1) ... [2025-03-03 14:17:43,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:17:44,102 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_spec3_product21.cil.c[62420,62433] [2025-03-03 14:17:44,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:44,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:17:44,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [622] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2141] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2802] [2025-03-03 14:17:44,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2817] [2025-03-03 14:17:44,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-03-03 14:17:44,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3013] [2025-03-03 14:17:44,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3379] [2025-03-03 14:17:44,234 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_spec3_product21.cil.c[62420,62433] [2025-03-03 14:17:44,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:44,271 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:17:44,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44 WrapperNode [2025-03-03 14:17:44,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:44,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:44,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:17:44,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:17:44,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,338 INFO L138 Inliner]: procedures = 90, calls = 345, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 880 [2025-03-03 14:17:44,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:44,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:17:44,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:17:44,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:17:44,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,372 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-03 14:17:44,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:17:44,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:17:44,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:17:44,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:17:44,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (1/1) ... [2025-03-03 14:17:44,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:44,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:17:44,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:17:44,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:17:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:17:44,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:17:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:17:44,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:17:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:17:44,456 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:17:44,456 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:17:44,456 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:17:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:17:44,457 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:17:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:17:44,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:17:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:17:44,457 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:17:44,457 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:17:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:17:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:17:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:17:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:17:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:17:44,458 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:17:44,458 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:17:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:17:44,459 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:17:44,459 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:17:44,461 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:17:44,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:17:44,462 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:17:44,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:17:44,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:17:44,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:17:44,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: #res := ~retValue_acc~9; [2025-03-03 14:17:44,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: #res := ~retValue_acc~4; [2025-03-03 14:17:44,675 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: #res := ~retValue_acc~2; [2025-03-03 14:17:44,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: #res := ~retValue_acc~5; [2025-03-03 14:17:44,679 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L855: #res := ~retValue_acc~6; [2025-03-03 14:17:44,885 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: #res#1 := ~retValue_acc~14#1; [2025-03-03 14:17:44,886 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1465-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~15#1; [2025-03-03 14:17:44,947 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1563: #res := ~retValue_acc~18; [2025-03-03 14:17:44,958 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: #res := ~retValue_acc~3; [2025-03-03 14:17:44,975 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L898: #res := ~retValue_acc~8; [2025-03-03 14:17:45,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1027-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-03 14:17:45,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-03 14:17:45,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1549-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-03-03 14:17:45,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~16#1; [2025-03-03 14:17:45,262 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488: #res := ~retValue_acc~21; [2025-03-03 14:17:45,363 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1392: #res := ~retValue_acc~13; [2025-03-03 14:17:45,424 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L405-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:17:45,424 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3411-1: valid_product_#res#1 := valid_product_~retValue_acc~27#1; [2025-03-03 14:17:45,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252: #res := ~retValue_acc~20; [2025-03-03 14:17:45,439 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: #res := ~retValue_acc~22; [2025-03-03 14:17:45,571 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2025-03-03 14:17:45,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:17:45,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:17:45,588 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:17:45,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:45 BoogieIcfgContainer [2025-03-03 14:17:45,588 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:17:45,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:17:45,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:17:45,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:17:45,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:17:43" (1/3) ... [2025-03-03 14:17:45,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755281f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:45, skipping insertion in model container [2025-03-03 14:17:45,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:44" (2/3) ... [2025-03-03 14:17:45,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755281f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:45, skipping insertion in model container [2025-03-03 14:17:45,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:45" (3/3) ... [2025-03-03 14:17:45,600 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product21.cil.c [2025-03-03 14:17:45,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:17:45,612 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product21.cil.c that has 27 procedures, 587 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:17:45,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:17:45,675 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;@69a61c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:17:45,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:17:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 453 states have (on average 1.6754966887417218) internal successors, (759), 471 states have internal predecessors, (759), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 14:17:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:17:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:45,696 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] [2025-03-03 14:17:45,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1465989718, now seen corresponding path program 1 times [2025-03-03 14:17:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862934723] [2025-03-03 14:17:45,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:45,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:17:45,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:17:45,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:46,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862934723] [2025-03-03 14:17:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862934723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:46,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:46,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748447673] [2025-03-03 14:17:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:46,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:46,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:46,371 INFO L87 Difference]: Start difference. First operand has 587 states, 453 states have (on average 1.6754966887417218) internal successors, (759), 471 states have internal predecessors, (759), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:46,595 INFO L93 Difference]: Finished difference Result 1171 states and 1954 transitions. [2025-03-03 14:17:46,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2025-03-03 14:17:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:46,613 INFO L225 Difference]: With dead ends: 1171 [2025-03-03 14:17:46,613 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:17:46,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:46,622 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 91 mSDsluCounter, 4685 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5639 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:46,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5639 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:17:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2025-03-03 14:17:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 456 states have (on average 1.668859649122807) internal successors, (761), 474 states have internal predecessors, (761), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-03-03 14:17:46,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 974 transitions. [2025-03-03 14:17:46,695 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 974 transitions. Word has length 99 [2025-03-03 14:17:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:46,695 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 974 transitions. [2025-03-03 14:17:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 974 transitions. [2025-03-03 14:17:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:17:46,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:46,703 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] [2025-03-03 14:17:46,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:17:46,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1665804298, now seen corresponding path program 1 times [2025-03-03 14:17:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508587761] [2025-03-03 14:17:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:46,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:17:46,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:17:46,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:46,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508587761] [2025-03-03 14:17:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508587761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737884618] [2025-03-03 14:17:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:46,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:46,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:47,000 INFO L87 Difference]: Start difference. First operand 590 states and 974 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:47,115 INFO L93 Difference]: Finished difference Result 1175 states and 1951 transitions. [2025-03-03 14:17:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-03-03 14:17:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:47,123 INFO L225 Difference]: With dead ends: 1175 [2025-03-03 14:17:47,124 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 14:17:47,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:47,128 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 90 mSDsluCounter, 4679 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:47,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5634 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 14:17:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 590. [2025-03-03 14:17:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 456 states have (on average 1.668859649122807) internal successors, (761), 474 states have internal predecessors, (761), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2025-03-03 14:17:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 974 transitions. [2025-03-03 14:17:47,168 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 974 transitions. Word has length 100 [2025-03-03 14:17:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 974 transitions. [2025-03-03 14:17:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 974 transitions. [2025-03-03 14:17:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:17:47,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:47,173 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] [2025-03-03 14:17:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:17:47,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1225651811, now seen corresponding path program 1 times [2025-03-03 14:17:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731378270] [2025-03-03 14:17:47,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:47,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:17:47,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:17:47,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:47,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:47,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:47,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731378270] [2025-03-03 14:17:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731378270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584200383] [2025-03-03 14:17:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:47,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:47,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:47,331 INFO L87 Difference]: Start difference. First operand 590 states and 974 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:47,384 INFO L93 Difference]: Finished difference Result 1162 states and 1929 transitions. [2025-03-03 14:17:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:47,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-03 14:17:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:47,388 INFO L225 Difference]: With dead ends: 1162 [2025-03-03 14:17:47,389 INFO L226 Difference]: Without dead ends: 560 [2025-03-03 14:17:47,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 14:17:47,393 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 14 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2827 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:47,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2827 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-03 14:17:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-03 14:17:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 429 states have (on average 1.6526806526806528) internal successors, (709), 445 states have internal predecessors, (709), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 918 transitions. [2025-03-03 14:17:47,420 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 918 transitions. Word has length 100 [2025-03-03 14:17:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:47,421 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 918 transitions. [2025-03-03 14:17:47,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 918 transitions. [2025-03-03 14:17:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:17:47,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:47,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:47,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:17:47,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:47,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 232932228, now seen corresponding path program 1 times [2025-03-03 14:17:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112177509] [2025-03-03 14:17:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:47,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:17:47,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:17:47,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:47,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:47,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112177509] [2025-03-03 14:17:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112177509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433489189] [2025-03-03 14:17:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:47,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:47,656 INFO L87 Difference]: Start difference. First operand 560 states and 918 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:47,719 INFO L93 Difference]: Finished difference Result 1113 states and 1835 transitions. [2025-03-03 14:17:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-03-03 14:17:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:47,725 INFO L225 Difference]: With dead ends: 1113 [2025-03-03 14:17:47,726 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:17:47,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:47,729 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 63 mSDsluCounter, 4482 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:47,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5390 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:17:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-03 14:17:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 423 states have (on average 1.6453900709219857) internal successors, (696), 439 states have internal predecessors, (696), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 905 transitions. [2025-03-03 14:17:47,754 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 905 transitions. Word has length 101 [2025-03-03 14:17:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 905 transitions. [2025-03-03 14:17:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 905 transitions. [2025-03-03 14:17:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:47,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:47,758 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-03 14:17:47,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:17:47,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1532723696, now seen corresponding path program 1 times [2025-03-03 14:17:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119653970] [2025-03-03 14:17:47,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:47,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:47,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:47,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:47,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119653970] [2025-03-03 14:17:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119653970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909341960] [2025-03-03 14:17:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:47,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:47,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:47,966 INFO L87 Difference]: Start difference. First operand 554 states and 905 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,029 INFO L93 Difference]: Finished difference Result 1101 states and 1809 transitions. [2025-03-03 14:17:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-03-03 14:17:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,033 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 14:17:48,033 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:48,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:48,037 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 49 mSDsluCounter, 4434 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:48,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5330 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 433 states have internal predecessors, (683), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 892 transitions. [2025-03-03 14:17:48,062 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 892 transitions. Word has length 102 [2025-03-03 14:17:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:48,062 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 892 transitions. [2025-03-03 14:17:48,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 892 transitions. [2025-03-03 14:17:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:48,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:48,065 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-03 14:17:48,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:17:48,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 792659528, now seen corresponding path program 1 times [2025-03-03 14:17:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568707181] [2025-03-03 14:17:48,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:48,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:48,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:48,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568707181] [2025-03-03 14:17:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568707181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:48,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48871485] [2025-03-03 14:17:48,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:48,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:48,253 INFO L87 Difference]: Start difference. First operand 548 states and 892 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,316 INFO L93 Difference]: Finished difference Result 1089 states and 1783 transitions. [2025-03-03 14:17:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-03-03 14:17:48,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,323 INFO L225 Difference]: With dead ends: 1089 [2025-03-03 14:17:48,323 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:48,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:48,327 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 24 mSDsluCounter, 4398 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:48,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6354916067146283) internal successors, (682), 433 states have internal predecessors, (682), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 891 transitions. [2025-03-03 14:17:48,354 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 891 transitions. Word has length 102 [2025-03-03 14:17:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 891 transitions. [2025-03-03 14:17:48,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 891 transitions. [2025-03-03 14:17:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:17:48,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:48,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:17:48,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash -930428578, now seen corresponding path program 1 times [2025-03-03 14:17:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:48,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32634069] [2025-03-03 14:17:48,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:48,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:17:48,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:17:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32634069] [2025-03-03 14:17:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32634069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291574917] [2025-03-03 14:17:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:48,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,485 INFO L87 Difference]: Start difference. First operand 548 states and 891 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,525 INFO L93 Difference]: Finished difference Result 1080 states and 1768 transitions. [2025-03-03 14:17:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:48,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-03-03 14:17:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,528 INFO L225 Difference]: With dead ends: 1080 [2025-03-03 14:17:48,528 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:48,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,531 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 15 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:48,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2613 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6330935251798562) internal successors, (681), 433 states have internal predecessors, (681), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 890 transitions. [2025-03-03 14:17:48,549 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 890 transitions. Word has length 103 [2025-03-03 14:17:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 890 transitions. [2025-03-03 14:17:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 890 transitions. [2025-03-03 14:17:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:17:48,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:48,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:17:48,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1161680552, now seen corresponding path program 1 times [2025-03-03 14:17:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125988283] [2025-03-03 14:17:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:48,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:17:48,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:17:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:48,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125988283] [2025-03-03 14:17:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125988283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733285313] [2025-03-03 14:17:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:48,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:48,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,649 INFO L87 Difference]: Start difference. First operand 548 states and 890 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,695 INFO L93 Difference]: Finished difference Result 1080 states and 1766 transitions. [2025-03-03 14:17:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-03 14:17:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,698 INFO L225 Difference]: With dead ends: 1080 [2025-03-03 14:17:48,699 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:48,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,702 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 14 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:48,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2615 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.630695443645084) internal successors, (680), 433 states have internal predecessors, (680), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 889 transitions. [2025-03-03 14:17:48,719 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 889 transitions. Word has length 104 [2025-03-03 14:17:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:48,719 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 889 transitions. [2025-03-03 14:17:48,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 889 transitions. [2025-03-03 14:17:48,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:17:48,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:48,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:48,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:17:48,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:48,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash -301133279, now seen corresponding path program 1 times [2025-03-03 14:17:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834946128] [2025-03-03 14:17:48,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:48,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:17:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:17:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834946128] [2025-03-03 14:17:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834946128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396884318] [2025-03-03 14:17:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:48,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,835 INFO L87 Difference]: Start difference. First operand 548 states and 889 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:48,874 INFO L93 Difference]: Finished difference Result 1080 states and 1764 transitions. [2025-03-03 14:17:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-03 14:17:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:48,878 INFO L225 Difference]: With dead ends: 1080 [2025-03-03 14:17:48,878 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:48,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,882 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 13 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:48,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2617 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6282973621103118) internal successors, (679), 433 states have internal predecessors, (679), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 888 transitions. [2025-03-03 14:17:48,900 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 888 transitions. Word has length 105 [2025-03-03 14:17:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:48,900 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 888 transitions. [2025-03-03 14:17:48,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 888 transitions. [2025-03-03 14:17:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:17:48,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:48,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:48,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:17:48,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 45452283, now seen corresponding path program 1 times [2025-03-03 14:17:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495450782] [2025-03-03 14:17:48,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:48,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:17:48,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:17:48,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:48,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495450782] [2025-03-03 14:17:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495450782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852920814] [2025-03-03 14:17:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:48,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:48,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:48,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:48,997 INFO L87 Difference]: Start difference. First operand 548 states and 888 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:49,035 INFO L93 Difference]: Finished difference Result 1080 states and 1762 transitions. [2025-03-03 14:17:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-03 14:17:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:49,039 INFO L225 Difference]: With dead ends: 1080 [2025-03-03 14:17:49,039 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:17:49,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:49,042 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 12 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:49,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2619 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:17:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-03 14:17:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 417 states have (on average 1.6258992805755397) internal successors, (678), 433 states have internal predecessors, (678), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-03 14:17:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 887 transitions. [2025-03-03 14:17:49,058 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 887 transitions. Word has length 106 [2025-03-03 14:17:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:49,058 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 887 transitions. [2025-03-03 14:17:49,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 887 transitions. [2025-03-03 14:17:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:17:49,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:49,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:49,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:17:49,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1639093988, now seen corresponding path program 1 times [2025-03-03 14:17:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040892062] [2025-03-03 14:17:49,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:49,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:17:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:17:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:49,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040892062] [2025-03-03 14:17:49,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040892062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:49,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988639936] [2025-03-03 14:17:49,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:49,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:49,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:49,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:17:49,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:17:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:17:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:49,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:49,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:49,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:49,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988639936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065605576] [2025-03-03 14:17:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:49,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:49,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:49,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:49,668 INFO L87 Difference]: Start difference. First operand 548 states and 887 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:49,734 INFO L93 Difference]: Finished difference Result 1555 states and 2549 transitions. [2025-03-03 14:17:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:49,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-03-03 14:17:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:49,741 INFO L225 Difference]: With dead ends: 1555 [2025-03-03 14:17:49,742 INFO L226 Difference]: Without dead ends: 1025 [2025-03-03 14:17:49,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:49,746 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 816 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:49,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1679 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-03 14:17:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1010. [2025-03-03 14:17:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 776 states have (on average 1.6391752577319587) internal successors, (1272), 807 states have internal predecessors, (1272), 187 states have call successors, (187), 47 states have call predecessors, (187), 46 states have return successors, (189), 181 states have call predecessors, (189), 184 states have call successors, (189) [2025-03-03 14:17:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1648 transitions. [2025-03-03 14:17:49,791 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1648 transitions. Word has length 107 [2025-03-03 14:17:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1648 transitions. [2025-03-03 14:17:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1648 transitions. [2025-03-03 14:17:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:17:49,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:49,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:49,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:50,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:17:50,000 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash -85276979, now seen corresponding path program 1 times [2025-03-03 14:17:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846826074] [2025-03-03 14:17:50,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:50,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:17:50,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:17:50,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:50,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846826074] [2025-03-03 14:17:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846826074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772894965] [2025-03-03 14:17:50,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:50,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:50,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:50,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:17:50,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:17:50,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:17:50,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:50,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:50,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:50,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:50,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772894965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:50,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:50,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:50,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064035125] [2025-03-03 14:17:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:50,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:50,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:50,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:50,630 INFO L87 Difference]: Start difference. First operand 1010 states and 1648 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:50,703 INFO L93 Difference]: Finished difference Result 2479 states and 4073 transitions. [2025-03-03 14:17:50,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:50,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-03 14:17:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:50,715 INFO L225 Difference]: With dead ends: 2479 [2025-03-03 14:17:50,715 INFO L226 Difference]: Without dead ends: 1487 [2025-03-03 14:17:50,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:50,722 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 815 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:50,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2025-03-03 14:17:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1439. [2025-03-03 14:17:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1108 states have (on average 1.651624548736462) internal successors, (1830), 1154 states have internal predecessors, (1830), 265 states have call successors, (265), 65 states have call predecessors, (265), 65 states have return successors, (272), 258 states have call predecessors, (272), 262 states have call successors, (272) [2025-03-03 14:17:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2367 transitions. [2025-03-03 14:17:50,780 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2367 transitions. Word has length 108 [2025-03-03 14:17:50,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:50,780 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2367 transitions. [2025-03-03 14:17:50,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:17:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2367 transitions. [2025-03-03 14:17:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:17:50,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:50,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:50,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:50,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:17:50,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 925344249, now seen corresponding path program 1 times [2025-03-03 14:17:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937276100] [2025-03-03 14:17:50,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:51,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:17:51,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:17:51,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:51,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937276100] [2025-03-03 14:17:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937276100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819907520] [2025-03-03 14:17:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:51,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:51,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:51,118 INFO L87 Difference]: Start difference. First operand 1439 states and 2367 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:51,631 INFO L93 Difference]: Finished difference Result 4241 states and 7108 transitions. [2025-03-03 14:17:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-03 14:17:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:51,650 INFO L225 Difference]: With dead ends: 4241 [2025-03-03 14:17:51,651 INFO L226 Difference]: Without dead ends: 2820 [2025-03-03 14:17:51,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:51,661 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 875 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 4591 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:51,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 4591 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:17:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2025-03-03 14:17:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2773. [2025-03-03 14:17:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2137 states have (on average 1.6518483855872719) internal successors, (3530), 2225 states have internal predecessors, (3530), 509 states have call successors, (509), 124 states have call predecessors, (509), 126 states have return successors, (595), 501 states have call predecessors, (595), 505 states have call successors, (595) [2025-03-03 14:17:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4634 transitions. [2025-03-03 14:17:51,787 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4634 transitions. Word has length 110 [2025-03-03 14:17:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:51,788 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 4634 transitions. [2025-03-03 14:17:51,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4634 transitions. [2025-03-03 14:17:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:17:51,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:51,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:17:51,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:51,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1242960209, now seen corresponding path program 1 times [2025-03-03 14:17:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715416631] [2025-03-03 14:17:51,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:17:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:17:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715416631] [2025-03-03 14:17:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715416631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919211912] [2025-03-03 14:17:51,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:51,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:51,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:17:52,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:17:52,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:17:52,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:52,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:52,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:52,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:52,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919211912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178835262] [2025-03-03 14:17:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:52,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:52,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:52,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:52,374 INFO L87 Difference]: Start difference. First operand 2773 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:52,650 INFO L93 Difference]: Finished difference Result 8029 states and 13688 transitions. [2025-03-03 14:17:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:52,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-03 14:17:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:52,687 INFO L225 Difference]: With dead ends: 8029 [2025-03-03 14:17:52,687 INFO L226 Difference]: Without dead ends: 5275 [2025-03-03 14:17:52,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:52,706 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 730 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:52,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1700 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2025-03-03 14:17:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5238. [2025-03-03 14:17:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 4024 states have (on average 1.6197813121272366) internal successors, (6518), 4198 states have internal predecessors, (6518), 966 states have call successors, (966), 242 states have call predecessors, (966), 247 states have return successors, (1262), 953 states have call predecessors, (1262), 960 states have call successors, (1262) [2025-03-03 14:17:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 8746 transitions. [2025-03-03 14:17:52,988 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 8746 transitions. Word has length 112 [2025-03-03 14:17:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:52,989 INFO L471 AbstractCegarLoop]: Abstraction has 5238 states and 8746 transitions. [2025-03-03 14:17:52,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 8746 transitions. [2025-03-03 14:17:52,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:17:52,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:52,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:53,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:53,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1082691507, now seen corresponding path program 1 times [2025-03-03 14:17:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203206037] [2025-03-03 14:17:53,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:17:53,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:17:53,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:53,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203206037] [2025-03-03 14:17:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203206037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440942151] [2025-03-03 14:17:53,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:53,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:53,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:17:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:17:53,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:17:53,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:17:53,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:53,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440942151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:53,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2025-03-03 14:17:53,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909178456] [2025-03-03 14:17:53,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:53,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:53,668 INFO L87 Difference]: Start difference. First operand 5238 states and 8746 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:54,044 INFO L93 Difference]: Finished difference Result 15600 states and 26371 transitions. [2025-03-03 14:17:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-03 14:17:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:54,103 INFO L225 Difference]: With dead ends: 15600 [2025-03-03 14:17:54,103 INFO L226 Difference]: Without dead ends: 10383 [2025-03-03 14:17:54,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:54,124 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 869 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:54,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1756 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2025-03-03 14:17:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 10280. [2025-03-03 14:17:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 7924 states have (on average 1.623296314992428) internal successors, (12863), 8252 states have internal predecessors, (12863), 1872 states have call successors, (1872), 466 states have call predecessors, (1872), 483 states have return successors, (2518), 1867 states have call predecessors, (2518), 1862 states have call successors, (2518) [2025-03-03 14:17:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 17253 transitions. [2025-03-03 14:17:54,518 INFO L78 Accepts]: Start accepts. Automaton has 10280 states and 17253 transitions. Word has length 117 [2025-03-03 14:17:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:54,518 INFO L471 AbstractCegarLoop]: Abstraction has 10280 states and 17253 transitions. [2025-03-03 14:17:54,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10280 states and 17253 transitions. [2025-03-03 14:17:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:17:54,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:54,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:54,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:17:54,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1473599689, now seen corresponding path program 1 times [2025-03-03 14:17:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316408712] [2025-03-03 14:17:54,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:54,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:17:54,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:17:54,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:54,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316408712] [2025-03-03 14:17:54,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316408712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:54,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819869652] [2025-03-03 14:17:54,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:54,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:54,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:17:55,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:17:55,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:17:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:55,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:17:55,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:55,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819869652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:55,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:55,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:17:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629525513] [2025-03-03 14:17:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:55,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:55,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:55,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:55,290 INFO L87 Difference]: Start difference. First operand 10280 states and 17253 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:17:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:56,218 INFO L93 Difference]: Finished difference Result 19433 states and 32712 transitions. [2025-03-03 14:17:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2025-03-03 14:17:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:56,278 INFO L225 Difference]: With dead ends: 19433 [2025-03-03 14:17:56,278 INFO L226 Difference]: Without dead ends: 9171 [2025-03-03 14:17:56,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:17:56,325 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 746 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:56,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 4310 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:17:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9171 states. [2025-03-03 14:17:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9171 to 9149. [2025-03-03 14:17:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9149 states, 7073 states have (on average 1.6110561289410434) internal successors, (11395), 7348 states have internal predecessors, (11395), 1638 states have call successors, (1638), 422 states have call predecessors, (1638), 437 states have return successors, (2192), 1634 states have call predecessors, (2192), 1628 states have call successors, (2192) [2025-03-03 14:17:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9149 states to 9149 states and 15225 transitions. [2025-03-03 14:17:56,721 INFO L78 Accepts]: Start accepts. Automaton has 9149 states and 15225 transitions. Word has length 118 [2025-03-03 14:17:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:56,721 INFO L471 AbstractCegarLoop]: Abstraction has 9149 states and 15225 transitions. [2025-03-03 14:17:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:17:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 9149 states and 15225 transitions. [2025-03-03 14:17:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:17:56,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:56,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:56,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:56,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:17:56,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:56,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:56,933 INFO L85 PathProgramCache]: Analyzing trace with hash -38296740, now seen corresponding path program 1 times [2025-03-03 14:17:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426753898] [2025-03-03 14:17:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:56,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:17:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:17:56,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426753898] [2025-03-03 14:17:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426753898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705930967] [2025-03-03 14:17:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:57,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:57,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:57,008 INFO L87 Difference]: Start difference. First operand 9149 states and 15225 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:57,369 INFO L93 Difference]: Finished difference Result 18328 states and 30865 transitions. [2025-03-03 14:17:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-03 14:17:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:57,424 INFO L225 Difference]: With dead ends: 18328 [2025-03-03 14:17:57,425 INFO L226 Difference]: Without dead ends: 9197 [2025-03-03 14:17:57,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 14:17:57,468 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 12 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:57,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2583 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9197 states. [2025-03-03 14:17:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9197 to 9165. [2025-03-03 14:17:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9165 states, 7085 states have (on average 1.609456598447424) internal successors, (11403), 7360 states have internal predecessors, (11403), 1638 states have call successors, (1638), 430 states have call predecessors, (1638), 441 states have return successors, (2170), 1630 states have call predecessors, (2170), 1628 states have call successors, (2170) [2025-03-03 14:17:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9165 states to 9165 states and 15211 transitions. [2025-03-03 14:17:57,826 INFO L78 Accepts]: Start accepts. Automaton has 9165 states and 15211 transitions. Word has length 117 [2025-03-03 14:17:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:57,827 INFO L471 AbstractCegarLoop]: Abstraction has 9165 states and 15211 transitions. [2025-03-03 14:17:57,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9165 states and 15211 transitions. [2025-03-03 14:17:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:17:57,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:57,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:57,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:17:57,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:57,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 481586524, now seen corresponding path program 1 times [2025-03-03 14:17:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56820004] [2025-03-03 14:17:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:17:57,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:17:57,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:57,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:17:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56820004] [2025-03-03 14:17:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56820004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561847800] [2025-03-03 14:17:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:57,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:57,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:57,958 INFO L87 Difference]: Start difference. First operand 9165 states and 15211 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:17:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:58,961 INFO L93 Difference]: Finished difference Result 27405 states and 47037 transitions. [2025-03-03 14:17:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:58,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-03 14:17:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:59,089 INFO L225 Difference]: With dead ends: 27405 [2025-03-03 14:17:59,090 INFO L226 Difference]: Without dead ends: 18258 [2025-03-03 14:17:59,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:59,158 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 871 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:59,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 4543 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18258 states. [2025-03-03 14:17:59,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18258 to 18157. [2025-03-03 14:17:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18157 states, 14040 states have (on average 1.604131054131054) internal successors, (22522), 14581 states have internal predecessors, (22522), 3231 states have call successors, (3231), 854 states have call predecessors, (3231), 885 states have return successors, (5111), 3233 states have call predecessors, (5111), 3213 states have call successors, (5111) [2025-03-03 14:18:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18157 states to 18157 states and 30864 transitions. [2025-03-03 14:18:00,088 INFO L78 Accepts]: Start accepts. Automaton has 18157 states and 30864 transitions. Word has length 125 [2025-03-03 14:18:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 18157 states and 30864 transitions. [2025-03-03 14:18:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:18:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18157 states and 30864 transitions. [2025-03-03 14:18:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:18:00,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:00,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:00,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:00,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash 125039742, now seen corresponding path program 1 times [2025-03-03 14:18:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724634569] [2025-03-03 14:18:00,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:00,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:18:00,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:18:00,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:00,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:18:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724634569] [2025-03-03 14:18:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724634569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662980786] [2025-03-03 14:18:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:00,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:00,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:00,166 INFO L87 Difference]: Start difference. First operand 18157 states and 30864 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:18:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:00,843 INFO L93 Difference]: Finished difference Result 36440 states and 62983 transitions. [2025-03-03 14:18:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-03 14:18:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:01,096 INFO L225 Difference]: With dead ends: 36440 [2025-03-03 14:18:01,096 INFO L226 Difference]: Without dead ends: 18301 [2025-03-03 14:18:01,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:18:01,173 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 12 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:01,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2574 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18301 states. [2025-03-03 14:18:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18301 to 18237. [2025-03-03 14:18:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18237 states, 14112 states have (on average 1.6016156462585034) internal successors, (22602), 14637 states have internal predecessors, (22602), 3231 states have call successors, (3231), 886 states have call predecessors, (3231), 893 states have return successors, (5079), 3225 states have call predecessors, (5079), 3213 states have call successors, (5079) [2025-03-03 14:18:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 30912 transitions. [2025-03-03 14:18:01,704 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 30912 transitions. Word has length 128 [2025-03-03 14:18:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:01,704 INFO L471 AbstractCegarLoop]: Abstraction has 18237 states and 30912 transitions. [2025-03-03 14:18:01,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:18:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 30912 transitions. [2025-03-03 14:18:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:18:01,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:01,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2025-03-03 14:18:01,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:01,710 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash -521291800, now seen corresponding path program 1 times [2025-03-03 14:18:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446157576] [2025-03-03 14:18:01,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:18:01,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:18:01,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446157576] [2025-03-03 14:18:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446157576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:01,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:01,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217979022] [2025-03-03 14:18:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:01,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:01,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:01,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:01,920 INFO L87 Difference]: Start difference. First operand 18237 states and 30912 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:18:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:03,494 INFO L93 Difference]: Finished difference Result 54773 states and 97358 transitions. [2025-03-03 14:18:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-03-03 14:18:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:03,779 INFO L225 Difference]: With dead ends: 54773 [2025-03-03 14:18:03,780 INFO L226 Difference]: Without dead ends: 36554 [2025-03-03 14:18:03,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:03,937 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 868 mSDsluCounter, 3565 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:03,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 4550 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36554 states. [2025-03-03 14:18:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36554 to 36389. [2025-03-03 14:18:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36389 states, 28163 states have (on average 1.5973795405319036) internal successors, (44987), 29204 states have internal predecessors, (44987), 6428 states have call successors, (6428), 1766 states have call predecessors, (6428), 1797 states have return successors, (12517), 6442 states have call predecessors, (12517), 6394 states have call successors, (12517) [2025-03-03 14:18:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36389 states to 36389 states and 63932 transitions. [2025-03-03 14:18:05,692 INFO L78 Accepts]: Start accepts. Automaton has 36389 states and 63932 transitions. Word has length 137 [2025-03-03 14:18:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,693 INFO L471 AbstractCegarLoop]: Abstraction has 36389 states and 63932 transitions. [2025-03-03 14:18:05,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:18:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36389 states and 63932 transitions. [2025-03-03 14:18:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:18:05,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:05,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:05,700 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1677810955, now seen corresponding path program 1 times [2025-03-03 14:18:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296488540] [2025-03-03 14:18:05,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:18:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:18:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:18:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:05,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296488540] [2025-03-03 14:18:05,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296488540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:05,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157631552] [2025-03-03 14:18:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:05,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:05,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:05,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:05,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:05,786 INFO L87 Difference]: Start difference. First operand 36389 states and 63932 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:18:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,509 INFO L93 Difference]: Finished difference Result 73048 states and 131600 transitions. [2025-03-03 14:18:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-03 14:18:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,772 INFO L225 Difference]: With dead ends: 73048 [2025-03-03 14:18:07,772 INFO L226 Difference]: Without dead ends: 36677 [2025-03-03 14:18:08,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:18:08,043 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 11 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:08,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2577 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36677 states. [2025-03-03 14:18:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36677 to 36549. [2025-03-03 14:18:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36549 states, 28307 states have (on average 1.5949058536757692) internal successors, (45147), 29348 states have internal predecessors, (45147), 6428 states have call successors, (6428), 1798 states have call predecessors, (6428), 1813 states have return successors, (12477), 6426 states have call predecessors, (12477), 6394 states have call successors, (12477) [2025-03-03 14:18:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36549 states to 36549 states and 64052 transitions. [2025-03-03 14:18:09,731 INFO L78 Accepts]: Start accepts. Automaton has 36549 states and 64052 transitions. Word has length 139 [2025-03-03 14:18:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 36549 states and 64052 transitions. [2025-03-03 14:18:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:18:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 36549 states and 64052 transitions. [2025-03-03 14:18:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:18:09,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:09,738 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:18:09,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:09,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash 849055450, now seen corresponding path program 1 times [2025-03-03 14:18:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142008359] [2025-03-03 14:18:09,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:09,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:18:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:18:09,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:18:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142008359] [2025-03-03 14:18:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142008359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:09,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:09,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:09,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064895809] [2025-03-03 14:18:09,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:09,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:09,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:09,924 INFO L87 Difference]: Start difference. First operand 36549 states and 64052 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:18:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:13,559 INFO L93 Difference]: Finished difference Result 109957 states and 206920 transitions. [2025-03-03 14:18:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-03-03 14:18:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:14,134 INFO L225 Difference]: With dead ends: 109957 [2025-03-03 14:18:14,135 INFO L226 Difference]: Without dead ends: 73426 [2025-03-03 14:18:14,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:14,467 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 863 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:14,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 4561 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73426 states. [2025-03-03 14:18:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73426 to 73133. [2025-03-03 14:18:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73133 states, 56646 states have (on average 1.5919923736892279) internal successors, (90180), 58719 states have internal predecessors, (90180), 12833 states have call successors, (12833), 3590 states have call predecessors, (12833), 3653 states have return successors, (32087), 12871 states have call predecessors, (32087), 12767 states have call successors, (32087) [2025-03-03 14:18:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73133 states to 73133 states and 135100 transitions. [2025-03-03 14:18:18,566 INFO L78 Accepts]: Start accepts. Automaton has 73133 states and 135100 transitions. Word has length 149 [2025-03-03 14:18:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:18,567 INFO L471 AbstractCegarLoop]: Abstraction has 73133 states and 135100 transitions. [2025-03-03 14:18:18,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:18:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73133 states and 135100 transitions. [2025-03-03 14:18:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:18:18,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:18,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:18,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:18:18,573 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:18,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash -26793757, now seen corresponding path program 1 times [2025-03-03 14:18:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119766071] [2025-03-03 14:18:18,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:18,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:18:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:18:18,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:18,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:18:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119766071] [2025-03-03 14:18:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119766071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:18,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:18,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:18,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269409844] [2025-03-03 14:18:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:18,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:18,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:18,637 INFO L87 Difference]: Start difference. First operand 73133 states and 135100 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:18:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:23,546 INFO L93 Difference]: Finished difference Result 146888 states and 281797 transitions. [2025-03-03 14:18:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-03-03 14:18:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:23,994 INFO L225 Difference]: With dead ends: 146888 [2025-03-03 14:18:23,994 INFO L226 Difference]: Without dead ends: 73773 [2025-03-03 14:18:24,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 14:18:24,589 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 9 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:24,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2574 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73773 states.