./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product27.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 11bb1f05736dca729c358ce9b340534ff3d0ef3cd2b5d7b8f4dea43dade9112f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:54,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:54,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:54,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:54,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:54,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:54,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:54,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:54,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:54,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:54,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:54,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:54,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:54,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:54,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:54,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:54,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:54,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:54,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:54,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:54,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:54,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:54,771 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 -> 11bb1f05736dca729c358ce9b340534ff3d0ef3cd2b5d7b8f4dea43dade9112f [2025-03-03 14:18:55,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:55,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:55,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:55,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:55,017 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:55,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c [2025-03-03 14:18:56,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7390b96/c2db7843f2e349ea8e1e8409d7870ae5/FLAGcf030d51e [2025-03-03 14:18:56,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:56,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c [2025-03-03 14:18:56,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7390b96/c2db7843f2e349ea8e1e8409d7870ae5/FLAGcf030d51e [2025-03-03 14:18:56,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7390b96/c2db7843f2e349ea8e1e8409d7870ae5 [2025-03-03 14:18:56,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:56,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:56,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:56,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:56,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:56,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:56" (1/1) ... [2025-03-03 14:18:56,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3105af8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:56, skipping insertion in model container [2025-03-03 14:18:56,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:56" (1/1) ... [2025-03-03 14:18:56,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:57,128 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c[66437,66450] [2025-03-03 14:18:57,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:57,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:57,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [414] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [516] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [873] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2432] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3093] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3105] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [3114] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3273] [2025-03-03 14:18:57,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3308] [2025-03-03 14:18:57,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product27.cil.c[66437,66450] [2025-03-03 14:18:57,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:57,273 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:57,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57 WrapperNode [2025-03-03 14:18:57,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:57,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:57,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:57,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:57,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,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:18:57" (1/1) ... [2025-03-03 14:18:57,332 INFO L138 Inliner]: procedures = 95, calls = 339, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 1118 [2025-03-03 14:18:57,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:57,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:57,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:57,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:57,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,371 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:18:57,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:57,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:57,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:57,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:57,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (1/1) ... [2025-03-03 14:18:57,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:57,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:57,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:18:57,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:18:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:18:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:57,642 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:57,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:57,702 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3423: #res := ~retValue_acc~29; [2025-03-03 14:18:57,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: #res := ~retValue_acc~27; [2025-03-03 14:18:57,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: #res := ~retValue_acc~5; [2025-03-03 14:18:57,742 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135: #res := ~retValue_acc~6; [2025-03-03 14:18:57,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1791: #res#1 := ~retValue_acc~16#1; [2025-03-03 14:18:57,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1178-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-03-03 14:18:57,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: #res := ~retValue_acc~20; [2025-03-03 14:18:58,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1672-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~13#1; [2025-03-03 14:18:58,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701: #res#1 := ~retValue_acc~14#1; [2025-03-03 14:18:58,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: #res := ~retValue_acc~18; [2025-03-03 14:18:58,201 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3384: #res := ~retValue_acc~28; [2025-03-03 14:18:58,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: #res := ~retValue_acc~10; [2025-03-03 14:18:58,316 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1307-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-03 14:18:58,316 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1320-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-03 14:18:58,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1144-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-03-03 14:18:58,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-03-03 14:18:58,517 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: #res := ~retValue_acc~23; [2025-03-03 14:18:58,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L870-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-03 14:18:58,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-03 14:18:58,595 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~22; [2025-03-03 14:18:58,601 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: #res := ~retValue_acc~24; [2025-03-03 14:18:58,723 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:58,723 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:58,745 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:58,745 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:58,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:58 BoogieIcfgContainer [2025-03-03 14:18:58,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:58,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:58,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:58,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:58,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:56" (1/3) ... [2025-03-03 14:18:58,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e3cde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:58, skipping insertion in model container [2025-03-03 14:18:58,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:57" (2/3) ... [2025-03-03 14:18:58,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21e3cde2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:58, skipping insertion in model container [2025-03-03 14:18:58,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:58" (3/3) ... [2025-03-03 14:18:58,752 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2025-03-03 14:18:58,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:58,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product27.cil.c that has 25 procedures, 559 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:58,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:58,825 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;@31a3112d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:58,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 440 states have (on average 1.6931818181818181) internal successors, (745), 461 states have internal predecessors, (745), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:18:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:18:58,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1887432724, now seen corresponding path program 1 times [2025-03-03 14:18:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170086223] [2025-03-03 14:18:58,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:18:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:18:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170086223] [2025-03-03 14:18:59,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170086223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860423667] [2025-03-03 14:18:59,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:59,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:59,346 INFO L87 Difference]: Start difference. First operand has 559 states, 440 states have (on average 1.6931818181818181) internal successors, (745), 461 states have internal predecessors, (745), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 87 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:18:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,491 INFO L93 Difference]: Finished difference Result 1098 states and 1837 transitions. [2025-03-03 14:18:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-03-03 14:18:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,508 INFO L225 Difference]: With dead ends: 1098 [2025-03-03 14:18:59,508 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:18:59,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:59,514 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 5 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2729 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:18:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:18:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6912442396313363) internal successors, (734), 453 states have internal predecessors, (734), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:18:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 915 transitions. [2025-03-03 14:18:59,581 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 915 transitions. Word has length 104 [2025-03-03 14:18:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,582 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 915 transitions. [2025-03-03 14:18:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:18:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 915 transitions. [2025-03-03 14:18:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:18:59,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:59,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1355644399, now seen corresponding path program 1 times [2025-03-03 14:18:59,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145279173] [2025-03-03 14:18:59,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:18:59,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:18:59,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145279173] [2025-03-03 14:18:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145279173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:59,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953325266] [2025-03-03 14:18:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:59,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:59,772 INFO L87 Difference]: Start difference. First operand 551 states and 915 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:18:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:59,839 INFO L93 Difference]: Finished difference Result 1084 states and 1807 transitions. [2025-03-03 14:18:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-03 14:18:59,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:59,845 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:18:59,845 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:18:59,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:59,848 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 4 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:59,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2708 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:18:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:18:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6889400921658986) internal successors, (733), 453 states have internal predecessors, (733), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:18:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 914 transitions. [2025-03-03 14:18:59,874 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 914 transitions. Word has length 107 [2025-03-03 14:18:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 914 transitions. [2025-03-03 14:18:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:18:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 914 transitions. [2025-03-03 14:18:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:18:59,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:59,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:59,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:59,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1610520846, now seen corresponding path program 1 times [2025-03-03 14:18:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094931440] [2025-03-03 14:18:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:59,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:18:59,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:18:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094931440] [2025-03-03 14:19:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094931440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198915331] [2025-03-03 14:19:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,049 INFO L87 Difference]: Start difference. First operand 551 states and 914 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,099 INFO L93 Difference]: Finished difference Result 1084 states and 1806 transitions. [2025-03-03 14:19:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-03 14:19:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,104 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:19:00,105 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:19:00,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,108 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 3 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2708 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:19:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:19:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6866359447004609) internal successors, (732), 453 states have internal predecessors, (732), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 913 transitions. [2025-03-03 14:19:00,136 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 913 transitions. Word has length 108 [2025-03-03 14:19:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,136 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 913 transitions. [2025-03-03 14:19:00,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 913 transitions. [2025-03-03 14:19:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:19:00,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:19:00,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1239116564, now seen corresponding path program 1 times [2025-03-03 14:19:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149296106] [2025-03-03 14:19:00,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:19:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:19:00,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:00,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149296106] [2025-03-03 14:19:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149296106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594071199] [2025-03-03 14:19:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:00,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:00,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,321 INFO L87 Difference]: Start difference. First operand 551 states and 913 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, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,381 INFO L93 Difference]: Finished difference Result 1084 states and 1805 transitions. [2025-03-03 14:19:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:00,384 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, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-03 14:19:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,391 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:19:00,391 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:19:00,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,397 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 2 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2708 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:19:00,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:19:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6843317972350231) internal successors, (731), 453 states have internal predecessors, (731), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 912 transitions. [2025-03-03 14:19:00,436 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 912 transitions. Word has length 109 [2025-03-03 14:19:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,436 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 912 transitions. [2025-03-03 14:19:00,437 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, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 912 transitions. [2025-03-03 14:19:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:19:00,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:19:00,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1544435733, now seen corresponding path program 1 times [2025-03-03 14:19:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563887185] [2025-03-03 14:19:00,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:19:00,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:19:00,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:00,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563887185] [2025-03-03 14:19:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563887185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806343660] [2025-03-03 14:19:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:00,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,600 INFO L87 Difference]: Start difference. First operand 551 states and 912 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,643 INFO L93 Difference]: Finished difference Result 1084 states and 1804 transitions. [2025-03-03 14:19:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-03 14:19:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,649 INFO L225 Difference]: With dead ends: 1084 [2025-03-03 14:19:00,650 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 14:19:00,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:00,653 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 1 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 14:19:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 14:19:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 434 states have (on average 1.6820276497695852) internal successors, (730), 453 states have internal predecessors, (730), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 911 transitions. [2025-03-03 14:19:00,687 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 911 transitions. Word has length 110 [2025-03-03 14:19:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 911 transitions. [2025-03-03 14:19:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 911 transitions. [2025-03-03 14:19:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:19:00,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:19:00,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -285300759, now seen corresponding path program 1 times [2025-03-03 14:19:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029245230] [2025-03-03 14:19:00,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:19:00,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:19:00,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:00,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029245230] [2025-03-03 14:19:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029245230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875152313] [2025-03-03 14:19:00,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:00,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:00,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:00,961 INFO L87 Difference]: Start difference. First operand 551 states and 911 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:01,084 INFO L93 Difference]: Finished difference Result 1050 states and 1736 transitions. [2025-03-03 14:19:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:19:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,089 INFO L225 Difference]: With dead ends: 1050 [2025-03-03 14:19:01,089 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:19:01,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:01,092 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 91 mSDsluCounter, 6210 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7109 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7109 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:19:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-03-03 14:19:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 444 states have (on average 1.677927927927928) internal successors, (745), 465 states have internal predecessors, (745), 94 states have call successors, (94), 24 states have call predecessors, (94), 25 states have return successors, (91), 87 states have call predecessors, (91), 89 states have call successors, (91) [2025-03-03 14:19:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 930 transitions. [2025-03-03 14:19:01,115 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 930 transitions. Word has length 111 [2025-03-03 14:19:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:01,115 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 930 transitions. [2025-03-03 14:19:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 930 transitions. [2025-03-03 14:19:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:19:01,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:01,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:19:01,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1094788216, now seen corresponding path program 1 times [2025-03-03 14:19:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778908568] [2025-03-03 14:19:01,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:01,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:19:01,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:19:01,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:01,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778908568] [2025-03-03 14:19:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778908568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:01,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:19:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537892537] [2025-03-03 14:19:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:19:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:01,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:19:01,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:01,216 INFO L87 Difference]: Start difference. First operand 564 states and 930 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:01,263 INFO L93 Difference]: Finished difference Result 1102 states and 1830 transitions. [2025-03-03 14:19:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:19:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-03 14:19:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,268 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:19:01,268 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:19:01,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:19:01,271 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:19:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:19:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6728971962616823) internal successors, (716), 447 states have internal predecessors, (716), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 897 transitions. [2025-03-03 14:19:01,300 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 897 transitions. Word has length 111 [2025-03-03 14:19:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:01,301 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 897 transitions. [2025-03-03 14:19:01,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 897 transitions. [2025-03-03 14:19:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:19:01,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:01,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:01,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:19:01,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:01,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1516846875, now seen corresponding path program 1 times [2025-03-03 14:19:01,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342423337] [2025-03-03 14:19:01,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:01,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:01,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:19:01,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:19:01,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:01,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:01,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342423337] [2025-03-03 14:19:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342423337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:01,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667477094] [2025-03-03 14:19:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:01,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:01,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:01,452 INFO L87 Difference]: Start difference. First operand 545 states and 897 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:01,623 INFO L93 Difference]: Finished difference Result 1047 states and 1728 transitions. [2025-03-03 14:19:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-03 14:19:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,629 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:19:01,629 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:19:01,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:01,631 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 55 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4241 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:19:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:19:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6635514018691588) internal successors, (712), 447 states have internal predecessors, (712), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 893 transitions. [2025-03-03 14:19:01,650 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 893 transitions. Word has length 112 [2025-03-03 14:19:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:01,651 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 893 transitions. [2025-03-03 14:19:01,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 893 transitions. [2025-03-03 14:19:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:19:01,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:01,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:01,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:19:01,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1069617024, now seen corresponding path program 1 times [2025-03-03 14:19:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006821757] [2025-03-03 14:19:01,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:01,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:19:01,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:19:01,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:01,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:01,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006821757] [2025-03-03 14:19:01,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006821757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:01,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:01,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786263731] [2025-03-03 14:19:01,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:01,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:01,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:01,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:01,803 INFO L87 Difference]: Start difference. First operand 545 states and 893 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:01,947 INFO L93 Difference]: Finished difference Result 1047 states and 1724 transitions. [2025-03-03 14:19:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-03-03 14:19:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,951 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:19:01,951 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:19:01,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:01,954 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 54 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4241 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:19:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:19:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.6542056074766356) internal successors, (708), 447 states have internal predecessors, (708), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 889 transitions. [2025-03-03 14:19:01,973 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 889 transitions. Word has length 113 [2025-03-03 14:19:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 889 transitions. [2025-03-03 14:19:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 889 transitions. [2025-03-03 14:19:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:19:01,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:01,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:01,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:19:01,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:01,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1091547330, now seen corresponding path program 1 times [2025-03-03 14:19:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752993974] [2025-03-03 14:19:01,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:19:01,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:19:01,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:01,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752993974] [2025-03-03 14:19:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752993974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116808221] [2025-03-03 14:19:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:02,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:02,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:02,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:02,100 INFO L87 Difference]: Start difference. First operand 545 states and 889 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:02,240 INFO L93 Difference]: Finished difference Result 1047 states and 1720 transitions. [2025-03-03 14:19:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:02,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-03 14:19:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:02,245 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:19:02,246 INFO L226 Difference]: Without dead ends: 554 [2025-03-03 14:19:02,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:02,248 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 53 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:02,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4223 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-03 14:19:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 545. [2025-03-03 14:19:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 428 states have (on average 1.644859813084112) internal successors, (704), 447 states have internal predecessors, (704), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 885 transitions. [2025-03-03 14:19:02,265 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 885 transitions. Word has length 114 [2025-03-03 14:19:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:02,265 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 885 transitions. [2025-03-03 14:19:02,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 885 transitions. [2025-03-03 14:19:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:19:02,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:02,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:02,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:19:02,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1032474925, now seen corresponding path program 1 times [2025-03-03 14:19:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485699703] [2025-03-03 14:19:02,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:02,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:19:02,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:19:02,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:02,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485699703] [2025-03-03 14:19:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485699703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:02,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:02,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526344486] [2025-03-03 14:19:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:02,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:02,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:02,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:02,390 INFO L87 Difference]: Start difference. First operand 545 states and 885 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:02,443 INFO L93 Difference]: Finished difference Result 1038 states and 1702 transitions. [2025-03-03 14:19:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:19:02,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:19:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:02,447 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 14:19:02,447 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:19:02,450 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:19:02,451 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 84 mSDsluCounter, 4297 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:02,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5171 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:19:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:19:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6461916461916462) internal successors, (670), 426 states have internal predecessors, (670), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 851 transitions. [2025-03-03 14:19:02,466 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 851 transitions. Word has length 114 [2025-03-03 14:19:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:02,466 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 851 transitions. [2025-03-03 14:19:02,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 851 transitions. [2025-03-03 14:19:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:19:02,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:02,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:02,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:19:02,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:02,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1077652419, now seen corresponding path program 1 times [2025-03-03 14:19:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816345745] [2025-03-03 14:19:02,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:02,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:19:02,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:19:02,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:02,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816345745] [2025-03-03 14:19:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816345745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:02,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:02,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:02,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355848531] [2025-03-03 14:19:02,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:02,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:02,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:02,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:02,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:02,583 INFO L87 Difference]: Start difference. First operand 524 states and 851 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:02,645 INFO L93 Difference]: Finished difference Result 1017 states and 1668 transitions. [2025-03-03 14:19:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-03 14:19:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:02,649 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:19:02,650 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:19:02,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:02,652 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 17 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:02,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:19:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:19:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6437346437346438) internal successors, (669), 426 states have internal predecessors, (669), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2025-03-03 14:19:02,671 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 850 transitions. Word has length 115 [2025-03-03 14:19:02,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:02,671 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 850 transitions. [2025-03-03 14:19:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 850 transitions. [2025-03-03 14:19:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:19:02,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:02,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:02,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1842560159, now seen corresponding path program 1 times [2025-03-03 14:19:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615150641] [2025-03-03 14:19:02,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:02,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:02,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:19:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:19:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615150641] [2025-03-03 14:19:02,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615150641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:02,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515635877] [2025-03-03 14:19:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:02,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:02,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:02,784 INFO L87 Difference]: Start difference. First operand 524 states and 850 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:02,850 INFO L93 Difference]: Finished difference Result 1017 states and 1667 transitions. [2025-03-03 14:19:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:02,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2025-03-03 14:19:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:02,854 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:19:02,854 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:19:02,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:02,856 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 16 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:02,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4161 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:19:02,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:19:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6412776412776413) internal successors, (668), 426 states have internal predecessors, (668), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 849 transitions. [2025-03-03 14:19:02,871 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 849 transitions. Word has length 116 [2025-03-03 14:19:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 849 transitions. [2025-03-03 14:19:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 849 transitions. [2025-03-03 14:19:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:02,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:02,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:02,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash 674202374, now seen corresponding path program 1 times [2025-03-03 14:19:02,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600032875] [2025-03-03 14:19:02,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:02,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:02,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:02,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:02,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600032875] [2025-03-03 14:19:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600032875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532660253] [2025-03-03 14:19:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:03,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:03,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:03,064 INFO L87 Difference]: Start difference. First operand 524 states and 849 transitions. Second operand has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:03,161 INFO L93 Difference]: Finished difference Result 1011 states and 1655 transitions. [2025-03-03 14:19:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:19:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-03 14:19:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:03,166 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 14:19:03,166 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:19:03,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:03,169 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 6 mSDsluCounter, 6642 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7475 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:03,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7475 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:19:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:19:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 407 states have (on average 1.6388206388206388) internal successors, (667), 426 states have internal predecessors, (667), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:19:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 848 transitions. [2025-03-03 14:19:03,186 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 848 transitions. Word has length 117 [2025-03-03 14:19:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:03,186 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 848 transitions. [2025-03-03 14:19:03,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 848 transitions. [2025-03-03 14:19:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:19:03,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:03,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:03,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:19:03,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:03,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash -666933324, now seen corresponding path program 1 times [2025-03-03 14:19:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823652584] [2025-03-03 14:19:03,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:03,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:19:03,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:19:03,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:03,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:19:03,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:03,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823652584] [2025-03-03 14:19:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823652584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927524920] [2025-03-03 14:19:03,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:03,304 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:19:03,306 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:19:03,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:19:03,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:19:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:03,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:03,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:03,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927524920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:03,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184840250] [2025-03-03 14:19:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:03,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:03,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:03,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:03,629 INFO L87 Difference]: Start difference. First operand 524 states and 848 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:03,677 INFO L93 Difference]: Finished difference Result 1473 states and 2441 transitions. [2025-03-03 14:19:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:03,677 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 118 [2025-03-03 14:19:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:03,685 INFO L225 Difference]: With dead ends: 1473 [2025-03-03 14:19:03,685 INFO L226 Difference]: Without dead ends: 994 [2025-03-03 14:19:03,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:03,689 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 832 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:03,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1754 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-03 14:19:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2025-03-03 14:19:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 772 states have (on average 1.660621761658031) internal successors, (1282), 805 states have internal predecessors, (1282), 176 states have call successors, (176), 43 states have call predecessors, (176), 43 states have return successors, (181), 169 states have call predecessors, (181), 171 states have call successors, (181) [2025-03-03 14:19:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1639 transitions. [2025-03-03 14:19:03,726 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1639 transitions. Word has length 118 [2025-03-03 14:19:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1639 transitions. [2025-03-03 14:19:03,728 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1639 transitions. [2025-03-03 14:19:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:19:03,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:03,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:03,740 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:19:03,935 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,SelfDestructingSolverStorable14 [2025-03-03 14:19:03,935 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:03,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash 799730257, now seen corresponding path program 1 times [2025-03-03 14:19:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:03,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544734657] [2025-03-03 14:19:03,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:03,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:19:03,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:19:03,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:03,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:19:04,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544734657] [2025-03-03 14:19:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544734657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373062685] [2025-03-03 14:19:04,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:04,041 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:19:04,043 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:19:04,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:19:04,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:19:04,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:04,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:04,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:04,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:04,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373062685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:04,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145610510] [2025-03-03 14:19:04,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:04,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:04,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:04,382 INFO L87 Difference]: Start difference. First operand 992 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:04,451 INFO L93 Difference]: Finished difference Result 2879 states and 4832 transitions. [2025-03-03 14:19:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:04,452 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2025-03-03 14:19:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:04,465 INFO L225 Difference]: With dead ends: 2879 [2025-03-03 14:19:04,465 INFO L226 Difference]: Without dead ends: 1932 [2025-03-03 14:19:04,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:04,472 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 831 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:04,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1710 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2025-03-03 14:19:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1929. [2025-03-03 14:19:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1503 states have (on average 1.6719893546240852) internal successors, (2513), 1564 states have internal predecessors, (2513), 342 states have call successors, (342), 81 states have call predecessors, (342), 83 states have return successors, (379), 335 states have call predecessors, (379), 337 states have call successors, (379) [2025-03-03 14:19:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3234 transitions. [2025-03-03 14:19:04,542 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3234 transitions. Word has length 119 [2025-03-03 14:19:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:04,542 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3234 transitions. [2025-03-03 14:19:04,543 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3234 transitions. [2025-03-03 14:19:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:19:04,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:04,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:04,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:19:04,746 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,SelfDestructingSolverStorable15 [2025-03-03 14:19:04,747 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -978342770, now seen corresponding path program 1 times [2025-03-03 14:19:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493063064] [2025-03-03 14:19:04,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:19:04,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:19:04,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:19:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493063064] [2025-03-03 14:19:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493063064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295102453] [2025-03-03 14:19:04,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:04,863 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:19:04,865 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:19:05,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:19:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:19:05,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:05,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:05,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:05,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:05,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295102453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052578897] [2025-03-03 14:19:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:05,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:05,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:05,200 INFO L87 Difference]: Start difference. First operand 1929 states and 3234 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:05,319 INFO L93 Difference]: Finished difference Result 5692 states and 9668 transitions. [2025-03-03 14:19:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:05,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 120 [2025-03-03 14:19:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:05,347 INFO L225 Difference]: With dead ends: 5692 [2025-03-03 14:19:05,347 INFO L226 Difference]: Without dead ends: 3808 [2025-03-03 14:19:05,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:05,359 INFO L435 NwaCegarLoop]: 912 mSDtfsCounter, 829 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:05,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1705 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2025-03-03 14:19:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3804. [2025-03-03 14:19:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3804 states, 2966 states have (on average 1.677343223196224) internal successors, (4975), 3083 states have internal predecessors, (4975), 674 states have call successors, (674), 157 states have call predecessors, (674), 163 states have return successors, (811), 667 states have call predecessors, (811), 669 states have call successors, (811) [2025-03-03 14:19:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3804 states to 3804 states and 6460 transitions. [2025-03-03 14:19:05,525 INFO L78 Accepts]: Start accepts. Automaton has 3804 states and 6460 transitions. Word has length 120 [2025-03-03 14:19:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:05,526 INFO L471 AbstractCegarLoop]: Abstraction has 3804 states and 6460 transitions. [2025-03-03 14:19:05,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3804 states and 6460 transitions. [2025-03-03 14:19:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:19:05,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:05,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:05,540 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:19:05,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:05,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:05,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash -264035541, now seen corresponding path program 1 times [2025-03-03 14:19:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:05,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072247767] [2025-03-03 14:19:05,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:05,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:05,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:19:05,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:19:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:05,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:19:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072247767] [2025-03-03 14:19:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072247767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017153684] [2025-03-03 14:19:05,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:05,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:05,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:05,835 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:19:05,838 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:19:05,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:19:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:19:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:06,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:06,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:06,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:06,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017153684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:06,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280659530] [2025-03-03 14:19:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:06,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:06,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:06,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:06,133 INFO L87 Difference]: Start difference. First operand 3804 states and 6460 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:06,376 INFO L93 Difference]: Finished difference Result 11319 states and 19517 transitions. [2025-03-03 14:19:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:06,376 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 121 [2025-03-03 14:19:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:06,424 INFO L225 Difference]: With dead ends: 11319 [2025-03-03 14:19:06,425 INFO L226 Difference]: Without dead ends: 7560 [2025-03-03 14:19:06,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:06,445 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 829 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:06,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1734 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2025-03-03 14:19:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 7555. [2025-03-03 14:19:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 5893 states have (on average 1.6794501951467844) internal successors, (9897), 6122 states have internal predecessors, (9897), 1338 states have call successors, (1338), 309 states have call predecessors, (1338), 323 states have return successors, (1795), 1331 states have call predecessors, (1795), 1333 states have call successors, (1795) [2025-03-03 14:19:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 13030 transitions. [2025-03-03 14:19:06,756 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 13030 transitions. Word has length 121 [2025-03-03 14:19:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:06,757 INFO L471 AbstractCegarLoop]: Abstraction has 7555 states and 13030 transitions. [2025-03-03 14:19:06,757 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), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 13030 transitions. [2025-03-03 14:19:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:19:06,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:06,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:06,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:19:06,961 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,SelfDestructingSolverStorable17 [2025-03-03 14:19:06,961 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 404648296, now seen corresponding path program 1 times [2025-03-03 14:19:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747708780] [2025-03-03 14:19:06,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:06,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:06,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:19:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:19:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:19:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747708780] [2025-03-03 14:19:07,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747708780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29700325] [2025-03-03 14:19:07,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:07,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:07,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:07,121 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:19:07,122 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:19:07,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:19:07,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:19:07,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:07,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:07,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1475 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:07,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:19:07,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:07,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29700325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:07,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 14:19:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113414256] [2025-03-03 14:19:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:07,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:07,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:07,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:07,485 INFO L87 Difference]: Start difference. First operand 7555 states and 13030 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:07,917 INFO L93 Difference]: Finished difference Result 22574 states and 39853 transitions. [2025-03-03 14:19:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 122 [2025-03-03 14:19:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,001 INFO L225 Difference]: With dead ends: 22574 [2025-03-03 14:19:08,002 INFO L226 Difference]: Without dead ends: 15056 [2025-03-03 14:19:08,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:08,038 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 826 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:08,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1754 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2025-03-03 14:19:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 15050. [2025-03-03 14:19:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15050 states, 11741 states have (on average 1.6796695341112342) internal successors, (19721), 12194 states have internal predecessors, (19721), 2666 states have call successors, (2666), 613 states have call predecessors, (2666), 642 states have return successors, (4194), 2658 states have call predecessors, (4194), 2661 states have call successors, (4194) [2025-03-03 14:19:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15050 states to 15050 states and 26581 transitions. [2025-03-03 14:19:08,684 INFO L78 Accepts]: Start accepts. Automaton has 15050 states and 26581 transitions. Word has length 122 [2025-03-03 14:19:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 15050 states and 26581 transitions. [2025-03-03 14:19:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:19:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 15050 states and 26581 transitions. [2025-03-03 14:19:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 14:19:08,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,706 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:08,714 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:19:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:08,906 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash -298097300, now seen corresponding path program 1 times [2025-03-03 14:19:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909376271] [2025-03-03 14:19:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 14:19:08,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 14:19:08,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909376271] [2025-03-03 14:19:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909376271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657033706] [2025-03-03 14:19:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:09,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:09,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:09,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:09,028 INFO L87 Difference]: Start difference. First operand 15050 states and 26581 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:09,951 INFO L93 Difference]: Finished difference Result 30183 states and 54936 transitions. [2025-03-03 14:19:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 190 [2025-03-03 14:19:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:10,066 INFO L225 Difference]: With dead ends: 30183 [2025-03-03 14:19:10,066 INFO L226 Difference]: Without dead ends: 15178 [2025-03-03 14:19:10,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:10,151 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 842 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:10,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 3107 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:19:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15178 states. [2025-03-03 14:19:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15178 to 15178. [2025-03-03 14:19:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15178 states, 11837 states have (on average 1.6741573033707866) internal successors, (19817), 12290 states have internal predecessors, (19817), 2666 states have call successors, (2666), 645 states have call predecessors, (2666), 674 states have return successors, (4226), 2658 states have call predecessors, (4226), 2661 states have call successors, (4226) [2025-03-03 14:19:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15178 states to 15178 states and 26709 transitions. [2025-03-03 14:19:10,899 INFO L78 Accepts]: Start accepts. Automaton has 15178 states and 26709 transitions. Word has length 190 [2025-03-03 14:19:10,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:10,900 INFO L471 AbstractCegarLoop]: Abstraction has 15178 states and 26709 transitions. [2025-03-03 14:19:10,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 15178 states and 26709 transitions. [2025-03-03 14:19:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 14:19:10,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:10,922 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:19:10,922 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1780355397, now seen corresponding path program 1 times [2025-03-03 14:19:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26678182] [2025-03-03 14:19:10,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:10,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 14:19:10,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 14:19:10,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:11,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26678182] [2025-03-03 14:19:11,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26678182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:11,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:11,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:11,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573201584] [2025-03-03 14:19:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:11,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:11,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:11,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:11,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:11,046 INFO L87 Difference]: Start difference. First operand 15178 states and 26709 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:11,847 INFO L93 Difference]: Finished difference Result 30471 states and 55160 transitions. [2025-03-03 14:19:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-03-03 14:19:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:11,977 INFO L225 Difference]: With dead ends: 30471 [2025-03-03 14:19:11,977 INFO L226 Difference]: Without dead ends: 15338 [2025-03-03 14:19:12,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:12,055 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:12,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:19:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15338 states. [2025-03-03 14:19:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15338 to 15338. [2025-03-03 14:19:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15338 states, 11965 states have (on average 1.6669452569995822) internal successors, (19945), 12418 states have internal predecessors, (19945), 2666 states have call successors, (2666), 677 states have call predecessors, (2666), 706 states have return successors, (4258), 2658 states have call predecessors, (4258), 2661 states have call successors, (4258) [2025-03-03 14:19:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15338 states to 15338 states and 26869 transitions. [2025-03-03 14:19:12,706 INFO L78 Accepts]: Start accepts. Automaton has 15338 states and 26869 transitions. Word has length 191 [2025-03-03 14:19:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 15338 states and 26869 transitions. [2025-03-03 14:19:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15338 states and 26869 transitions. [2025-03-03 14:19:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 14:19:12,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:12,722 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:19:12,722 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -484614385, now seen corresponding path program 1 times [2025-03-03 14:19:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032016251] [2025-03-03 14:19:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:12,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 14:19:12,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 14:19:12,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:12,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:12,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:12,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032016251] [2025-03-03 14:19:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032016251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280937125] [2025-03-03 14:19:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:12,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:12,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:12,845 INFO L87 Difference]: Start difference. First operand 15338 states and 26869 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:13,614 INFO L93 Difference]: Finished difference Result 30823 states and 55448 transitions. [2025-03-03 14:19:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 192 [2025-03-03 14:19:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:13,744 INFO L225 Difference]: With dead ends: 30823 [2025-03-03 14:19:13,744 INFO L226 Difference]: Without dead ends: 15530 [2025-03-03 14:19:13,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:13,817 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:13,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:19:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15530 states. [2025-03-03 14:19:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15530 to 15530. [2025-03-03 14:19:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15530 states, 12125 states have (on average 1.6581443298969072) internal successors, (20105), 12578 states have internal predecessors, (20105), 2666 states have call successors, (2666), 709 states have call predecessors, (2666), 738 states have return successors, (4290), 2658 states have call predecessors, (4290), 2661 states have call successors, (4290) [2025-03-03 14:19:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15530 states to 15530 states and 27061 transitions. [2025-03-03 14:19:14,398 INFO L78 Accepts]: Start accepts. Automaton has 15530 states and 27061 transitions. Word has length 192 [2025-03-03 14:19:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:14,399 INFO L471 AbstractCegarLoop]: Abstraction has 15530 states and 27061 transitions. [2025-03-03 14:19:14,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15530 states and 27061 transitions. [2025-03-03 14:19:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 14:19:14,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:14,414 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:19:14,414 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 43272456, now seen corresponding path program 1 times [2025-03-03 14:19:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796042024] [2025-03-03 14:19:14,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:14,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 14:19:14,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 14:19:14,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:14,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:14,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796042024] [2025-03-03 14:19:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796042024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:14,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:14,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:14,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384408122] [2025-03-03 14:19:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:14,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:14,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:14,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:14,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:14,564 INFO L87 Difference]: Start difference. First operand 15530 states and 27061 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:15,504 INFO L93 Difference]: Finished difference Result 31239 states and 55800 transitions. [2025-03-03 14:19:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:15,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2025-03-03 14:19:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:15,661 INFO L225 Difference]: With dead ends: 31239 [2025-03-03 14:19:15,661 INFO L226 Difference]: Without dead ends: 15754 [2025-03-03 14:19:15,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:15,763 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 841 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:15,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 3113 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:19:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2025-03-03 14:19:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15754. [2025-03-03 14:19:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15754 states, 12317 states have (on average 1.6478850369408136) internal successors, (20297), 12770 states have internal predecessors, (20297), 2666 states have call successors, (2666), 741 states have call predecessors, (2666), 770 states have return successors, (4322), 2658 states have call predecessors, (4322), 2661 states have call successors, (4322) [2025-03-03 14:19:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15754 states to 15754 states and 27285 transitions. [2025-03-03 14:19:16,675 INFO L78 Accepts]: Start accepts. Automaton has 15754 states and 27285 transitions. Word has length 193 [2025-03-03 14:19:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:16,676 INFO L471 AbstractCegarLoop]: Abstraction has 15754 states and 27285 transitions. [2025-03-03 14:19:16,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 15754 states and 27285 transitions. [2025-03-03 14:19:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 14:19:16,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:16,687 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:19:16,687 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:16,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1250368690, now seen corresponding path program 1 times [2025-03-03 14:19:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099875183] [2025-03-03 14:19:16,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:16,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 14:19:16,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 14:19:16,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:16,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099875183] [2025-03-03 14:19:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099875183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:16,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:16,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052422532] [2025-03-03 14:19:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:16,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:16,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:16,947 INFO L87 Difference]: Start difference. First operand 15754 states and 27285 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 8 states have internal predecessors, (122), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:19:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:22,764 INFO L93 Difference]: Finished difference Result 70182 states and 133698 transitions. [2025-03-03 14:19:22,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 14:19:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 8 states have internal predecessors, (122), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2025-03-03 14:19:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:23,337 INFO L225 Difference]: With dead ends: 70182 [2025-03-03 14:19:23,338 INFO L226 Difference]: Without dead ends: 54473 [2025-03-03 14:19:23,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:19:23,506 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 2556 mSDsluCounter, 4552 mSDsCounter, 0 mSdLazyCounter, 10408 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 5453 SdHoareTripleChecker+Invalid, 11029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 10408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:23,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2667 Valid, 5453 Invalid, 11029 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [621 Valid, 10408 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 14:19:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54473 states. [2025-03-03 14:19:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54473 to 53168. [2025-03-03 14:19:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53168 states, 40448 states have (on average 1.6306121439873418) internal successors, (65955), 42181 states have internal predecessors, (65955), 10124 states have call successors, (10124), 2214 states have call predecessors, (10124), 2595 states have return successors, (23234), 10340 states have call predecessors, (23234), 10119 states have call successors, (23234) [2025-03-03 14:19:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53168 states to 53168 states and 99313 transitions. [2025-03-03 14:19:26,720 INFO L78 Accepts]: Start accepts. Automaton has 53168 states and 99313 transitions. Word has length 194 [2025-03-03 14:19:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:26,720 INFO L471 AbstractCegarLoop]: Abstraction has 53168 states and 99313 transitions. [2025-03-03 14:19:26,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 8 states have internal predecessors, (122), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 7 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:19:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 53168 states and 99313 transitions. [2025-03-03 14:19:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 14:19:26,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:26,778 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:26,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:19:26,779 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:26,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 629525514, now seen corresponding path program 1 times [2025-03-03 14:19:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672411157] [2025-03-03 14:19:26,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:26,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 14:19:26,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 14:19:26,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:26,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 14:19:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672411157] [2025-03-03 14:19:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672411157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:19:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149988996] [2025-03-03 14:19:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:19:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:19:26,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:26,920 INFO L87 Difference]: Start difference. First operand 53168 states and 99313 transitions. Second operand has 8 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:28,402 INFO L93 Difference]: Finished difference Result 68725 states and 126268 transitions. [2025-03-03 14:19:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:19:28,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 197 [2025-03-03 14:19:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:28,532 INFO L225 Difference]: With dead ends: 68725 [2025-03-03 14:19:28,532 INFO L226 Difference]: Without dead ends: 15591 [2025-03-03 14:19:28,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:28,788 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 8 mSDsluCounter, 4945 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5773 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:28,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5773 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15591 states. [2025-03-03 14:19:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15591 to 15591. [2025-03-03 14:19:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15591 states, 12218 states have (on average 1.647569160255361) internal successors, (20130), 12671 states have internal predecessors, (20130), 2602 states have call successors, (2602), 741 states have call predecessors, (2602), 770 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-03-03 14:19:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15591 states to 15591 states and 26990 transitions. [2025-03-03 14:19:29,518 INFO L78 Accepts]: Start accepts. Automaton has 15591 states and 26990 transitions. Word has length 197 [2025-03-03 14:19:29,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:29,519 INFO L471 AbstractCegarLoop]: Abstraction has 15591 states and 26990 transitions. [2025-03-03 14:19:29,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 3 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:19:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand 15591 states and 26990 transitions. [2025-03-03 14:19:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 14:19:29,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:29,532 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:29,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:19:29,532 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:29,532 INFO L85 PathProgramCache]: Analyzing trace with hash 142208851, now seen corresponding path program 1 times [2025-03-03 14:19:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552812398] [2025-03-03 14:19:29,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 14:19:29,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 14:19:29,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:29,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 14:19:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552812398] [2025-03-03 14:19:29,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552812398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:29,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:29,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601676311] [2025-03-03 14:19:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:29,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:29,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:29,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:29,810 INFO L87 Difference]: Start difference. First operand 15591 states and 26990 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:19:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:31,721 INFO L93 Difference]: Finished difference Result 31268 states and 55281 transitions. [2025-03-03 14:19:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) Word has length 200 [2025-03-03 14:19:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:31,867 INFO L225 Difference]: With dead ends: 31268 [2025-03-03 14:19:31,867 INFO L226 Difference]: Without dead ends: 15719 [2025-03-03 14:19:31,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:19:31,958 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1274 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:31,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1725 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:19:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15719 states. [2025-03-03 14:19:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15719 to 15719. [2025-03-03 14:19:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15719 states, 12314 states have (on average 1.6425207081370798) internal successors, (20226), 12767 states have internal predecessors, (20226), 2602 states have call successors, (2602), 741 states have call predecessors, (2602), 802 states have return successors, (4418), 2626 states have call predecessors, (4418), 2597 states have call successors, (4418) [2025-03-03 14:19:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15719 states to 15719 states and 27246 transitions. [2025-03-03 14:19:32,708 INFO L78 Accepts]: Start accepts. Automaton has 15719 states and 27246 transitions. Word has length 200 [2025-03-03 14:19:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:32,708 INFO L471 AbstractCegarLoop]: Abstraction has 15719 states and 27246 transitions. [2025-03-03 14:19:32,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 8 states have internal predecessors, (127), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:19:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 15719 states and 27246 transitions. [2025-03-03 14:19:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 14:19:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:32,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:19:32,720 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1203911546, now seen corresponding path program 1 times [2025-03-03 14:19:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372528593] [2025-03-03 14:19:32,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:32,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:19:32,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:19:32,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:32,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 14:19:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:32,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372528593] [2025-03-03 14:19:32,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372528593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:32,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:19:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065463260] [2025-03-03 14:19:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:32,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:19:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:32,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:19:32,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:32,892 INFO L87 Difference]: Start difference. First operand 15719 states and 27246 transitions. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:19:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:36,620 INFO L93 Difference]: Finished difference Result 61823 states and 111547 transitions. [2025-03-03 14:19:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:19:36,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) Word has length 201 [2025-03-03 14:19:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:37,025 INFO L225 Difference]: With dead ends: 61823 [2025-03-03 14:19:37,025 INFO L226 Difference]: Without dead ends: 46146 [2025-03-03 14:19:37,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:19:37,249 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 3414 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 4989 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3486 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 5900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 4989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:37,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3486 Valid, 2201 Invalid, 5900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 4989 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46146 states. [2025-03-03 14:19:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46146 to 45742. [2025-03-03 14:19:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45742 states, 35748 states have (on average 1.6124538435716684) internal successors, (57642), 37096 states have internal predecessors, (57642), 7592 states have call successors, (7592), 2309 states have call predecessors, (7592), 2401 states have return successors, (15136), 7489 states have call predecessors, (15136), 7587 states have call successors, (15136) [2025-03-03 14:19:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45742 states to 45742 states and 80370 transitions. [2025-03-03 14:19:39,595 INFO L78 Accepts]: Start accepts. Automaton has 45742 states and 80370 transitions. Word has length 201 [2025-03-03 14:19:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:39,596 INFO L471 AbstractCegarLoop]: Abstraction has 45742 states and 80370 transitions. [2025-03-03 14:19:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (24), 6 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:19:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 45742 states and 80370 transitions. [2025-03-03 14:19:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 14:19:39,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:39,608 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:39,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:19:39,609 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:39,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:39,609 INFO L85 PathProgramCache]: Analyzing trace with hash -274408538, now seen corresponding path program 1 times [2025-03-03 14:19:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:39,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375599563] [2025-03-03 14:19:39,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:39,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:39,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 14:19:39,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 14:19:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:39,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-03 14:19:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375599563] [2025-03-03 14:19:39,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375599563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:39,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:39,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:19:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632010458] [2025-03-03 14:19:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:19:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:39,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:19:39,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:39,840 INFO L87 Difference]: Start difference. First operand 45742 states and 80370 transitions. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:19:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:48,393 INFO L93 Difference]: Finished difference Result 165043 states and 341718 transitions. [2025-03-03 14:19:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 5 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 203 [2025-03-03 14:19:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:50,166 INFO L225 Difference]: With dead ends: 165043 [2025-03-03 14:19:50,166 INFO L226 Difference]: Without dead ends: 119343 [2025-03-03 14:19:50,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:19:50,684 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 3245 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 6177 mSolverCounterSat, 941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3279 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 7118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 6177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:50,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3279 Valid, 3207 Invalid, 7118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 6177 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 14:19:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119343 states. [2025-03-03 14:19:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119343 to 106932. [2025-03-03 14:19:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106932 states, 80077 states have (on average 1.5928418896811818) internal successors, (127550), 84497 states have internal predecessors, (127550), 21702 states have call successors, (21702), 4613 states have call predecessors, (21702), 5152 states have return successors, (52141), 21663 states have call predecessors, (52141), 21697 states have call successors, (52141)