./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product19.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 d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:34:37,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:34:37,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:34:37,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:34:37,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:34:37,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:34:37,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:34:37,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:34:37,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:34:37,365 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:34:37,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:34:37,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:34:37,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:34:37,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:34:37,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:34:37,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:34:37,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:34:37,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:34:37,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:37,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:34:37,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:34:37,367 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 -> d96f41c83679efe744540e7fde7918287d6cc79be28bb1ad9b63bf8e0d07ce19 [2025-03-16 18:34:37,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:34:37,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:34:37,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:34:37,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:34:37,614 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:34:37,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2025-03-16 18:34:38,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7896e0a/e9a2cf3edb33436aa45f80982521c2e7/FLAG1cf468a5c [2025-03-16 18:34:39,065 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:34:39,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c [2025-03-16 18:34:39,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7896e0a/e9a2cf3edb33436aa45f80982521c2e7/FLAG1cf468a5c [2025-03-16 18:34:39,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7896e0a/e9a2cf3edb33436aa45f80982521c2e7 [2025-03-16 18:34:39,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:34:39,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:34:39,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:39,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:34:39,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:34:39,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a3daa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39, skipping insertion in model container [2025-03-16 18:34:39,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:34:39,606 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c[34453,34466] [2025-03-16 18:34:39,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:39,727 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:34:39,733 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [48] [2025-03-16 18:34:39,734 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1596] [2025-03-16 18:34:39,734 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1605] [2025-03-16 18:34:39,734 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2267] [2025-03-16 18:34:39,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2281] [2025-03-16 18:34:39,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2462] [2025-03-16 18:34:39,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2581] [2025-03-16 18:34:39,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2673] [2025-03-16 18:34:39,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3026] [2025-03-16 18:34:39,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3392] [2025-03-16 18:34:39,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product19.cil.c[34453,34466] [2025-03-16 18:34:39,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:39,849 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:34:39,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39 WrapperNode [2025-03-16 18:34:39,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:39,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:39,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:34:39,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:34:39,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,902 INFO L138 Inliner]: procedures = 94, calls = 340, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1115 [2025-03-16 18:34:39,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:39,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:34:39,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:34:39,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:34:39,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,946 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:34:39,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,964 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:34:39,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:34:39,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:34:39,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:34:39,980 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (1/1) ... [2025-03-16 18:34:39,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:40,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:34:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:34:40,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:34:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:34:40,028 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:34:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:34:40,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:34:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-16 18:34:40,028 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2025-03-16 18:34:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:34:40,028 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:34:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-16 18:34:40,029 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-16 18:34:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:34:40,029 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:34:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:34:40,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:34:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:34:40,029 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:34:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:34:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:34:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:34:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:34:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:34:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:34:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:34:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:34:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:34:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:34:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:34:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:34:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:34:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:34:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:34:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:34:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:34:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:34:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:34:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:34:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:34:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:34:40,032 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:34:40,176 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:34:40,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:34:40,231 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2578: #res := ~retValue_acc~22; [2025-03-16 18:34:40,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2500: #res := ~retValue_acc~20; [2025-03-16 18:34:40,250 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~0; [2025-03-16 18:34:40,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: #res := ~retValue_acc~1; [2025-03-16 18:34:40,317 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: #res#1 := ~retValue_acc~11#1; [2025-03-16 18:34:40,318 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L342-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-03-16 18:34:40,342 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584: #res := ~retValue_acc~15; [2025-03-16 18:34:40,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: #res#1 := ~retValue_acc~9#1; [2025-03-16 18:34:40,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L836-1: stopRequestedInDirection__wrappee__weight_#res#1 := stopRequestedInDirection__wrappee__weight_~retValue_acc~8#1; [2025-03-16 18:34:40,677 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: #res := ~retValue_acc~13; [2025-03-16 18:34:40,687 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: #res := ~retValue_acc~21; [2025-03-16 18:34:40,770 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L471-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-16 18:34:40,770 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L484-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-16 18:34:40,884 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-16 18:34:40,934 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1953: #res := ~retValue_acc~18; [2025-03-16 18:34:40,992 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023-1: main_#res#1 := main_~retValue_acc~24#1; [2025-03-16 18:34:40,992 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424-1: valid_product_#res#1 := valid_product_~retValue_acc~29#1; [2025-03-16 18:34:41,006 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717: #res := ~retValue_acc~17; [2025-03-16 18:34:41,008 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: #res := ~retValue_acc~2; [2025-03-16 18:34:41,011 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: #res := ~retValue_acc~19; [2025-03-16 18:34:41,112 INFO L? ?]: Removed 449 outVars from TransFormulas that were not future-live. [2025-03-16 18:34:41,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:34:41,134 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:34:41,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:34:41,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:41 BoogieIcfgContainer [2025-03-16 18:34:41,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:34:41,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:34:41,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:34:41,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:34:41,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:34:39" (1/3) ... [2025-03-16 18:34:41,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336445cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:41, skipping insertion in model container [2025-03-16 18:34:41,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:39" (2/3) ... [2025-03-16 18:34:41,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336445cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:41, skipping insertion in model container [2025-03-16 18:34:41,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:41" (3/3) ... [2025-03-16 18:34:41,145 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2025-03-16 18:34:41,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:34:41,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product19.cil.c that has 25 procedures, 552 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:34:41,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:34:41,236 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;@112897d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:34:41,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:34:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 552 states, 430 states have (on average 1.7) internal successors, (731), 451 states have internal predecessors, (731), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-16 18:34:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:34:41,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:41,256 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] [2025-03-16 18:34:41,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:41,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1431095574, now seen corresponding path program 1 times [2025-03-16 18:34:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239599109] [2025-03-16 18:34:41,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:41,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:34:41,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:34:41,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:41,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:41,738 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-16 18:34:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239599109] [2025-03-16 18:34:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239599109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:41,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098425052] [2025-03-16 18:34:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:41,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:41,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:41,760 INFO L87 Difference]: Start difference. First operand has 552 states, 430 states have (on average 1.7) internal successors, (731), 451 states have internal predecessors, (731), 96 states have call successors, (96), 24 states have call predecessors, (96), 24 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:41,894 INFO L93 Difference]: Finished difference Result 1089 states and 1826 transitions. [2025-03-16 18:34:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2025-03-16 18:34:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:41,914 INFO L225 Difference]: With dead ends: 1089 [2025-03-16 18:34:41,914 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:41,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:41,924 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:41,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2705 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6964705882352942) internal successors, (721), 444 states have internal predecessors, (721), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 908 transitions. [2025-03-16 18:34:41,996 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 908 transitions. Word has length 97 [2025-03-16 18:34:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 908 transitions. [2025-03-16 18:34:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 908 transitions. [2025-03-16 18:34:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:34:42,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:42,004 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] [2025-03-16 18:34:42,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:34:42,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1543159679, now seen corresponding path program 1 times [2025-03-16 18:34:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:42,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764328918] [2025-03-16 18:34:42,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:42,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:34:42,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:34:42,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:42,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:42,222 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-16 18:34:42,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764328918] [2025-03-16 18:34:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764328918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:42,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482945801] [2025-03-16 18:34:42,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:42,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:42,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:42,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,226 INFO L87 Difference]: Start difference. First operand 545 states and 908 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:42,297 INFO L93 Difference]: Finished difference Result 1077 states and 1798 transitions. [2025-03-16 18:34:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-16 18:34:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:42,303 INFO L225 Difference]: With dead ends: 1077 [2025-03-16 18:34:42,303 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:42,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,308 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 4 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:42,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2687 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6941176470588235) internal successors, (720), 444 states have internal predecessors, (720), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 907 transitions. [2025-03-16 18:34:42,344 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 907 transitions. Word has length 99 [2025-03-16 18:34:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:42,344 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 907 transitions. [2025-03-16 18:34:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 907 transitions. [2025-03-16 18:34:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 18:34:42,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:42,350 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] [2025-03-16 18:34:42,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:34:42,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:42,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1454981544, now seen corresponding path program 1 times [2025-03-16 18:34:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240994133] [2025-03-16 18:34:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:42,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 18:34:42,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 18:34:42,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:42,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:42,501 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-16 18:34:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240994133] [2025-03-16 18:34:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240994133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522593419] [2025-03-16 18:34:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:42,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:42,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:42,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,504 INFO L87 Difference]: Start difference. First operand 545 states and 907 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:42,562 INFO L93 Difference]: Finished difference Result 1077 states and 1797 transitions. [2025-03-16 18:34:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-16 18:34:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:42,566 INFO L225 Difference]: With dead ends: 1077 [2025-03-16 18:34:42,570 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:42,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,572 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 3 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:42,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2687 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:42,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6917647058823528) internal successors, (719), 444 states have internal predecessors, (719), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2025-03-16 18:34:42,599 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 100 [2025-03-16 18:34:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:42,600 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2025-03-16 18:34:42,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2025-03-16 18:34:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:34:42,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:42,602 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] [2025-03-16 18:34:42,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:34:42,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:42,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 336749924, now seen corresponding path program 1 times [2025-03-16 18:34:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021454189] [2025-03-16 18:34:42,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:34:42,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:34:42,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:42,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:42,742 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-16 18:34:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021454189] [2025-03-16 18:34:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021454189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415051894] [2025-03-16 18:34:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:42,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,743 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:42,780 INFO L93 Difference]: Finished difference Result 1077 states and 1796 transitions. [2025-03-16 18:34:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-16 18:34:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:42,784 INFO L225 Difference]: With dead ends: 1077 [2025-03-16 18:34:42,784 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:42,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,788 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 2 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:42,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2687 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6894117647058824) internal successors, (718), 444 states have internal predecessors, (718), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 905 transitions. [2025-03-16 18:34:42,811 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 905 transitions. Word has length 101 [2025-03-16 18:34:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:42,811 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 905 transitions. [2025-03-16 18:34:42,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 905 transitions. [2025-03-16 18:34:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:34:42,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:42,814 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] [2025-03-16 18:34:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:34:42,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -895940133, now seen corresponding path program 1 times [2025-03-16 18:34:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955459700] [2025-03-16 18:34:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:42,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:34:42,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:34:42,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:42,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:42,940 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-16 18:34:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:42,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955459700] [2025-03-16 18:34:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955459700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139919224] [2025-03-16 18:34:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:42,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:42,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,941 INFO L87 Difference]: Start difference. First operand 545 states and 905 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:42,979 INFO L93 Difference]: Finished difference Result 1077 states and 1795 transitions. [2025-03-16 18:34:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:42,979 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, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-16 18:34:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:42,984 INFO L225 Difference]: With dead ends: 1077 [2025-03-16 18:34:42,984 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:42,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:42,987 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 1 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:42,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2687 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6870588235294117) internal successors, (717), 444 states have internal predecessors, (717), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2025-03-16 18:34:43,012 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 102 [2025-03-16 18:34:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:43,012 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2025-03-16 18:34:43,012 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, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2025-03-16 18:34:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:34:43,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:43,015 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] [2025-03-16 18:34:43,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:34:43,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1928259336, now seen corresponding path program 1 times [2025-03-16 18:34:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072453823] [2025-03-16 18:34:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:34:43,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:34:43,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:43,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:43,131 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-16 18:34:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072453823] [2025-03-16 18:34:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072453823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51311246] [2025-03-16 18:34:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:43,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:43,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:43,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:43,133 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:43,166 INFO L93 Difference]: Finished difference Result 1077 states and 1794 transitions. [2025-03-16 18:34:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-03-16 18:34:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:43,170 INFO L225 Difference]: With dead ends: 1077 [2025-03-16 18:34:43,170 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:34:43,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:43,173 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:43,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2687 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:34:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-16 18:34:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 425 states have (on average 1.6847058823529413) internal successors, (716), 444 states have internal predecessors, (716), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2025-03-16 18:34:43,188 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 103 [2025-03-16 18:34:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:43,188 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2025-03-16 18:34:43,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2025-03-16 18:34:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:34:43,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:43,191 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] [2025-03-16 18:34:43,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:34:43,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:43,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:43,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1396416953, now seen corresponding path program 1 times [2025-03-16 18:34:43,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:43,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928007519] [2025-03-16 18:34:43,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:43,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:34:43,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:34:43,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:43,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:43,356 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-16 18:34:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928007519] [2025-03-16 18:34:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928007519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944149639] [2025-03-16 18:34:43,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:43,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:43,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:43,362 INFO L87 Difference]: Start difference. First operand 545 states and 903 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 18:34:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:43,451 INFO L93 Difference]: Finished difference Result 1037 states and 1718 transitions. [2025-03-16 18:34:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-03-16 18:34:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:43,457 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 18:34:43,457 INFO L226 Difference]: Without dead ends: 539 [2025-03-16 18:34:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:43,460 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 91 mSDsluCounter, 4373 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5264 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:43,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5264 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-16 18:34:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-16 18:34:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 419 states have (on average 1.6778042959427208) internal successors, (703), 438 states have internal predecessors, (703), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 890 transitions. [2025-03-16 18:34:43,481 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 890 transitions. Word has length 103 [2025-03-16 18:34:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:43,481 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 890 transitions. [2025-03-16 18:34:43,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 18:34:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 890 transitions. [2025-03-16 18:34:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 18:34:43,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:43,484 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-16 18:34:43,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:34:43,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 811236563, now seen corresponding path program 1 times [2025-03-16 18:34:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:43,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632263571] [2025-03-16 18:34:43,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:43,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:43,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 18:34:43,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 18:34:43,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:43,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:43,605 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-16 18:34:43,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:43,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632263571] [2025-03-16 18:34:43,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632263571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:43,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:43,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:43,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277039078] [2025-03-16 18:34:43,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:43,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:43,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:43,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:43,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:43,607 INFO L87 Difference]: Start difference. First operand 539 states and 890 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:43,775 INFO L93 Difference]: Finished difference Result 1040 states and 1719 transitions. [2025-03-16 18:34:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:43,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-16 18:34:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:43,780 INFO L225 Difference]: With dead ends: 1040 [2025-03-16 18:34:43,780 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:43,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:43,783 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 55 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:43,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4206 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-16 18:34:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 419 states have (on average 1.668257756563246) internal successors, (699), 438 states have internal predecessors, (699), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 886 transitions. [2025-03-16 18:34:43,802 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 886 transitions. Word has length 104 [2025-03-16 18:34:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 886 transitions. [2025-03-16 18:34:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 886 transitions. [2025-03-16 18:34:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:34:43,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:43,805 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] [2025-03-16 18:34:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:34:43,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1642412848, now seen corresponding path program 1 times [2025-03-16 18:34:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580550553] [2025-03-16 18:34:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:34:43,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:34:43,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:43,913 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-16 18:34:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580550553] [2025-03-16 18:34:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580550553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824285925] [2025-03-16 18:34:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:43,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:43,915 INFO L87 Difference]: Start difference. First operand 539 states and 886 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,046 INFO L93 Difference]: Finished difference Result 1040 states and 1715 transitions. [2025-03-16 18:34:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-16 18:34:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,051 INFO L225 Difference]: With dead ends: 1040 [2025-03-16 18:34:44,051 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:44,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:44,053 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 54 mSDsluCounter, 3359 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4206 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-16 18:34:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 419 states have (on average 1.6587112171837708) internal successors, (695), 438 states have internal predecessors, (695), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 882 transitions. [2025-03-16 18:34:44,069 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 882 transitions. Word has length 105 [2025-03-16 18:34:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 882 transitions. [2025-03-16 18:34:44,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 882 transitions. [2025-03-16 18:34:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:34:44,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,072 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] [2025-03-16 18:34:44,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:34:44,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1064697904, now seen corresponding path program 1 times [2025-03-16 18:34:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431224144] [2025-03-16 18:34:44,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 18:34:44,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:34:44,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,196 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-16 18:34:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431224144] [2025-03-16 18:34:44,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431224144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354159749] [2025-03-16 18:34:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:44,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:44,198 INFO L87 Difference]: Start difference. First operand 539 states and 882 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,318 INFO L93 Difference]: Finished difference Result 1040 states and 1711 transitions. [2025-03-16 18:34:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:44,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-16 18:34:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,322 INFO L225 Difference]: With dead ends: 1040 [2025-03-16 18:34:44,322 INFO L226 Difference]: Without dead ends: 548 [2025-03-16 18:34:44,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:44,324 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 53 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4188 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-16 18:34:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2025-03-16 18:34:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 419 states have (on average 1.6491646778042959) internal successors, (691), 438 states have internal predecessors, (691), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 878 transitions. [2025-03-16 18:34:44,344 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 878 transitions. Word has length 106 [2025-03-16 18:34:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 878 transitions. [2025-03-16 18:34:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 878 transitions. [2025-03-16 18:34:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:34:44,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,348 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] [2025-03-16 18:34:44,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:34:44,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1212537921, now seen corresponding path program 1 times [2025-03-16 18:34:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327679108] [2025-03-16 18:34:44,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 18:34:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:34:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,475 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-16 18:34:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327679108] [2025-03-16 18:34:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327679108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992876978] [2025-03-16 18:34:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:44,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:44,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:44,476 INFO L87 Difference]: Start difference. First operand 539 states and 878 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 18:34:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,529 INFO L93 Difference]: Finished difference Result 1031 states and 1693 transitions. [2025-03-16 18:34:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-03-16 18:34:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,533 INFO L225 Difference]: With dead ends: 1031 [2025-03-16 18:34:44,533 INFO L226 Difference]: Without dead ends: 518 [2025-03-16 18:34:44,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:44,535 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 84 mSDsluCounter, 4262 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5129 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-16 18:34:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-16 18:34:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.650753768844221) internal successors, (657), 417 states have internal predecessors, (657), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 844 transitions. [2025-03-16 18:34:44,551 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 844 transitions. Word has length 106 [2025-03-16 18:34:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,551 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 844 transitions. [2025-03-16 18:34:44,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-16 18:34:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 844 transitions. [2025-03-16 18:34:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:34:44,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,553 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-16 18:34:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:34:44,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1003968467, now seen corresponding path program 1 times [2025-03-16 18:34:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417977089] [2025-03-16 18:34:44,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:34:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:34:44,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,652 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-16 18:34:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417977089] [2025-03-16 18:34:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417977089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239915245] [2025-03-16 18:34:44,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:44,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:44,654 INFO L87 Difference]: Start difference. First operand 518 states and 844 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,712 INFO L93 Difference]: Finished difference Result 1010 states and 1659 transitions. [2025-03-16 18:34:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:44,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-16 18:34:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,716 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:34:44,716 INFO L226 Difference]: Without dead ends: 518 [2025-03-16 18:34:44,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:44,719 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 17 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4126 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-16 18:34:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-16 18:34:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.6482412060301508) internal successors, (656), 417 states have internal predecessors, (656), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 843 transitions. [2025-03-16 18:34:44,734 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 843 transitions. Word has length 107 [2025-03-16 18:34:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,734 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 843 transitions. [2025-03-16 18:34:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 843 transitions. [2025-03-16 18:34:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:34:44,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,737 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-16 18:34:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:34:44,737 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,737 INFO L85 PathProgramCache]: Analyzing trace with hash 210079437, now seen corresponding path program 1 times [2025-03-16 18:34:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956093718] [2025-03-16 18:34:44,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 18:34:44,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:34:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:44,857 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-16 18:34:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956093718] [2025-03-16 18:34:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956093718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:44,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:44,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:44,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648475120] [2025-03-16 18:34:44,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:44,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:44,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:44,858 INFO L87 Difference]: Start difference. First operand 518 states and 843 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:44,922 INFO L93 Difference]: Finished difference Result 1010 states and 1658 transitions. [2025-03-16 18:34:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-16 18:34:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:44,927 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:34:44,927 INFO L226 Difference]: Without dead ends: 518 [2025-03-16 18:34:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:44,930 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 16 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:44,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4126 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-16 18:34:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-16 18:34:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.6457286432160805) internal successors, (655), 417 states have internal predecessors, (655), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 842 transitions. [2025-03-16 18:34:44,946 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 842 transitions. Word has length 108 [2025-03-16 18:34:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:44,946 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 842 transitions. [2025-03-16 18:34:44,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 842 transitions. [2025-03-16 18:34:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 18:34:44,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:44,948 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-16 18:34:44,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:34:44,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:44,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1477705846, now seen corresponding path program 1 times [2025-03-16 18:34:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:44,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408983633] [2025-03-16 18:34:44,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:44,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 18:34:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 18:34:44,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:44,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,029 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-16 18:34:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408983633] [2025-03-16 18:34:45,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408983633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:45,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246283281] [2025-03-16 18:34:45,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:45,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,031 INFO L87 Difference]: Start difference. First operand 518 states and 842 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:45,063 INFO L93 Difference]: Finished difference Result 1004 states and 1646 transitions. [2025-03-16 18:34:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:45,064 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-16 18:34:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:45,068 INFO L225 Difference]: With dead ends: 1004 [2025-03-16 18:34:45,068 INFO L226 Difference]: Without dead ends: 518 [2025-03-16 18:34:45,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,070 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 5 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:45,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2480 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-16 18:34:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-16 18:34:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.64321608040201) internal successors, (654), 417 states have internal predecessors, (654), 96 states have call successors, (96), 24 states have call predecessors, (96), 23 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:34:45,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 841 transitions. [2025-03-16 18:34:45,087 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 841 transitions. Word has length 109 [2025-03-16 18:34:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,088 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 841 transitions. [2025-03-16 18:34:45,088 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:34:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 841 transitions. [2025-03-16 18:34:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 18:34:45,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,090 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-16 18:34:45,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:34:45,091 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash -925938790, now seen corresponding path program 1 times [2025-03-16 18:34:45,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660141724] [2025-03-16 18:34:45,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 18:34:45,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 18:34:45,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,203 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-16 18:34:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660141724] [2025-03-16 18:34:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660141724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224574734] [2025-03-16 18:34:45,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:45,206 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-16 18:34:45,207 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-16 18:34:45,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 18:34:45,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 18:34:45,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:34:45,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:45,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224574734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:34:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615805521] [2025-03-16 18:34:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:45,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:45,586 INFO L87 Difference]: Start difference. First operand 518 states and 841 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-16 18:34:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:46,007 INFO L93 Difference]: Finished difference Result 1004 states and 1668 transitions. [2025-03-16 18:34:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:46,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-16 18:34:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:46,012 INFO L225 Difference]: With dead ends: 1004 [2025-03-16 18:34:46,012 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 18:34:46,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:46,014 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 806 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:46,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2101 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:34:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 18:34:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 18:34:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 405 states have (on average 1.6444444444444444) internal successors, (666), 424 states have internal predecessors, (666), 96 states have call successors, (96), 25 states have call predecessors, (96), 24 states have return successors, (92), 89 states have call predecessors, (92), 91 states have call successors, (92) [2025-03-16 18:34:46,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 854 transitions. [2025-03-16 18:34:46,032 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 854 transitions. Word has length 110 [2025-03-16 18:34:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:46,032 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 854 transitions. [2025-03-16 18:34:46,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-16 18:34:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 854 transitions. [2025-03-16 18:34:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 18:34:46,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:46,034 INFO L218 NwaCegarLoop]: trace histogram [2, 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-16 18:34:46,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:34:46,235 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-16 18:34:46,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1255670758, now seen corresponding path program 1 times [2025-03-16 18:34:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965850103] [2025-03-16 18:34:46,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:46,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 18:34:46,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 18:34:46,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:46,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:46,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965850103] [2025-03-16 18:34:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965850103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001370132] [2025-03-16 18:34:46,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:46,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:46,339 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-16 18:34:46,341 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-16 18:34:46,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 18:34:46,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 18:34:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:46,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:34:46,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:46,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001370132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:46,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:34:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654928039] [2025-03-16 18:34:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:46,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:46,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:46,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:46,708 INFO L87 Difference]: Start difference. First operand 526 states and 854 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 18:34:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:47,122 INFO L93 Difference]: Finished difference Result 1020 states and 1691 transitions. [2025-03-16 18:34:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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 112 [2025-03-16 18:34:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:47,127 INFO L225 Difference]: With dead ends: 1020 [2025-03-16 18:34:47,127 INFO L226 Difference]: Without dead ends: 534 [2025-03-16 18:34:47,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:47,130 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 793 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:47,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2098 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:34:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-16 18:34:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-16 18:34:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 412 states have (on average 1.645631067961165) internal successors, (678), 431 states have internal predecessors, (678), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-03-16 18:34:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 867 transitions. [2025-03-16 18:34:47,150 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 867 transitions. Word has length 112 [2025-03-16 18:34:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:47,151 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 867 transitions. [2025-03-16 18:34:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 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-16 18:34:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 867 transitions. [2025-03-16 18:34:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 18:34:47,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:47,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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-16 18:34:47,162 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-16 18:34:47,356 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-16 18:34:47,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:47,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -91314246, now seen corresponding path program 1 times [2025-03-16 18:34:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:47,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619245240] [2025-03-16 18:34:47,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:47,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:34:47,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:34:47,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:47,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619245240] [2025-03-16 18:34:47,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619245240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160392001] [2025-03-16 18:34:47,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:47,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:47,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:47,472 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-16 18:34:47,474 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-16 18:34:47,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:34:47,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:34:47,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:47,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:47,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:34:47,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:47,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160392001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:34:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858138744] [2025-03-16 18:34:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:47,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:47,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:47,796 INFO L87 Difference]: Start difference. First operand 534 states and 867 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-16 18:34:48,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:48,169 INFO L93 Difference]: Finished difference Result 1036 states and 1714 transitions. [2025-03-16 18:34:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:48,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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 114 [2025-03-16 18:34:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:48,174 INFO L225 Difference]: With dead ends: 1036 [2025-03-16 18:34:48,174 INFO L226 Difference]: Without dead ends: 542 [2025-03-16 18:34:48,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:48,176 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 797 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:48,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2095 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:34:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-16 18:34:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-16 18:34:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 419 states have (on average 1.6467780429594272) internal successors, (690), 438 states have internal predecessors, (690), 96 states have call successors, (96), 27 states have call predecessors, (96), 26 states have return successors, (94), 89 states have call predecessors, (94), 91 states have call successors, (94) [2025-03-16 18:34:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 880 transitions. [2025-03-16 18:34:48,191 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 880 transitions. Word has length 114 [2025-03-16 18:34:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:48,192 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 880 transitions. [2025-03-16 18:34:48,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 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-16 18:34:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 880 transitions. [2025-03-16 18:34:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 18:34:48,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:48,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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-16 18:34:48,202 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-16 18:34:48,394 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-16 18:34:48,395 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1788983200, now seen corresponding path program 1 times [2025-03-16 18:34:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239849526] [2025-03-16 18:34:48,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:48,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 18:34:48,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 18:34:48,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:48,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:48,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:48,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239849526] [2025-03-16 18:34:48,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239849526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:48,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95572965] [2025-03-16 18:34:48,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:48,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:48,497 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-16 18:34:48,499 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-16 18:34:48,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 18:34:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 18:34:48,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:48,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:48,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:34:48,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:48,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95572965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:48,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:48,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:34:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203153224] [2025-03-16 18:34:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:48,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:48,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:48,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:48,808 INFO L87 Difference]: Start difference. First operand 542 states and 880 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-16 18:34:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:49,168 INFO L93 Difference]: Finished difference Result 1052 states and 1737 transitions. [2025-03-16 18:34:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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 116 [2025-03-16 18:34:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:49,172 INFO L225 Difference]: With dead ends: 1052 [2025-03-16 18:34:49,172 INFO L226 Difference]: Without dead ends: 550 [2025-03-16 18:34:49,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:49,174 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 776 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:49,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2092 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:34:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-16 18:34:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-16 18:34:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 426 states have (on average 1.647887323943662) internal successors, (702), 445 states have internal predecessors, (702), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-16 18:34:49,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 893 transitions. [2025-03-16 18:34:49,190 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 893 transitions. Word has length 116 [2025-03-16 18:34:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:49,190 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 893 transitions. [2025-03-16 18:34:49,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 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-16 18:34:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 893 transitions. [2025-03-16 18:34:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 18:34:49,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:49,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-16 18:34:49,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:34:49,397 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-16 18:34:49,397 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 469551514, now seen corresponding path program 1 times [2025-03-16 18:34:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509523280] [2025-03-16 18:34:49,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:49,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:49,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 18:34:49,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 18:34:49,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:49,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509523280] [2025-03-16 18:34:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509523280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046205002] [2025-03-16 18:34:49,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:49,504 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-16 18:34:49,507 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-16 18:34:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 18:34:49,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 18:34:49,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:49,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:49,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:34:49,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:34:49,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046205002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:34:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423689884] [2025-03-16 18:34:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:49,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:49,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:49,871 INFO L87 Difference]: Start difference. First operand 550 states and 893 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 18:34:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:50,210 INFO L93 Difference]: Finished difference Result 597 states and 963 transitions. [2025-03-16 18:34:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-16 18:34:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:50,215 INFO L225 Difference]: With dead ends: 597 [2025-03-16 18:34:50,215 INFO L226 Difference]: Without dead ends: 582 [2025-03-16 18:34:50,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:50,216 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 821 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:50,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2125 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:34:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-16 18:34:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 552. [2025-03-16 18:34:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.644859813084112) internal successors, (704), 447 states have internal predecessors, (704), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-16 18:34:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 895 transitions. [2025-03-16 18:34:50,237 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 895 transitions. Word has length 118 [2025-03-16 18:34:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:50,238 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 895 transitions. [2025-03-16 18:34:50,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 18:34:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 895 transitions. [2025-03-16 18:34:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-16 18:34:50,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:50,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-16 18:34:50,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:34:50,440 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-16 18:34:50,441 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -407993224, now seen corresponding path program 1 times [2025-03-16 18:34:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:50,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051920242] [2025-03-16 18:34:50,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:50,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 18:34:50,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 18:34:50,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:50,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:34:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051920242] [2025-03-16 18:34:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051920242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211620935] [2025-03-16 18:34:50,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:50,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:50,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:50,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:50,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:34:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-16 18:34:50,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-16 18:34:50,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:50,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 18:34:50,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:34:50,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211620935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:50,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-16 18:34:50,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175536288] [2025-03-16 18:34:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:50,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:50,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:50,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:50,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:50,804 INFO L87 Difference]: Start difference. First operand 552 states and 895 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 18:34:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:50,829 INFO L93 Difference]: Finished difference Result 567 states and 913 transitions. [2025-03-16 18:34:50,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:50,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2025-03-16 18:34:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:50,833 INFO L225 Difference]: With dead ends: 567 [2025-03-16 18:34:50,833 INFO L226 Difference]: Without dead ends: 552 [2025-03-16 18:34:50,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:50,834 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 0 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3348 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:50,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3348 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-03-16 18:34:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-03-16 18:34:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 447 states have internal predecessors, (703), 96 states have call successors, (96), 28 states have call predecessors, (96), 27 states have return successors, (95), 89 states have call predecessors, (95), 91 states have call successors, (95) [2025-03-16 18:34:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 894 transitions. [2025-03-16 18:34:50,856 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 894 transitions. Word has length 124 [2025-03-16 18:34:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:50,856 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 894 transitions. [2025-03-16 18:34:50,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 18:34:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 894 transitions. [2025-03-16 18:34:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 18:34:50,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:50,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1] [2025-03-16 18:34:50,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 18:34:51,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:51,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:51,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:51,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1142013583, now seen corresponding path program 1 times [2025-03-16 18:34:51,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:51,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641047615] [2025-03-16 18:34:51,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:51,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:34:51,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:34:51,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:51,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:34:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641047615] [2025-03-16 18:34:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641047615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806905670] [2025-03-16 18:34:51,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:51,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:51,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:51,185 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:51,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 18:34:51,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:34:51,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:34:51,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:51,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:51,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:34:51,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 18:34:51,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806905670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-16 18:34:51,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425473569] [2025-03-16 18:34:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:51,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:51,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:51,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:51,484 INFO L87 Difference]: Start difference. First operand 552 states and 894 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 18:34:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:51,814 INFO L93 Difference]: Finished difference Result 1066 states and 1766 transitions. [2025-03-16 18:34:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-16 18:34:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:51,818 INFO L225 Difference]: With dead ends: 1066 [2025-03-16 18:34:51,818 INFO L226 Difference]: Without dead ends: 554 [2025-03-16 18:34:51,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 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-16 18:34:51,821 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 770 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:51,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2089 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:34:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-16 18:34:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-03-16 18:34:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 429 states have (on average 1.6317016317016317) internal successors, (700), 449 states have internal predecessors, (700), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 89 states have call predecessors, (96), 91 states have call successors, (96) [2025-03-16 18:34:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 892 transitions. [2025-03-16 18:34:51,838 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 892 transitions. Word has length 134 [2025-03-16 18:34:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:51,838 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 892 transitions. [2025-03-16 18:34:51,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 18:34:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 892 transitions. [2025-03-16 18:34:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 18:34:51,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:51,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1] [2025-03-16 18:34:51,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 18:34:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:52,042 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:52,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash 252310833, now seen corresponding path program 1 times [2025-03-16 18:34:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274340386] [2025-03-16 18:34:52,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:52,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:34:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:34:52,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:52,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 18:34:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274340386] [2025-03-16 18:34:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274340386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952987686] [2025-03-16 18:34:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:52,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:52,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 18:34:52,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:34:52,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:34:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:52,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-16 18:34:52,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:34:52,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:52,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952987686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:52,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:52,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-16 18:34:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923191458] [2025-03-16 18:34:52,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:52,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:34:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:52,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:34:52,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:34:52,677 INFO L87 Difference]: Start difference. First operand 554 states and 892 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-16 18:34:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:55,020 INFO L93 Difference]: Finished difference Result 1917 states and 3146 transitions. [2025-03-16 18:34:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 18:34:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 134 [2025-03-16 18:34:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:55,028 INFO L225 Difference]: With dead ends: 1917 [2025-03-16 18:34:55,029 INFO L226 Difference]: Without dead ends: 1401 [2025-03-16 18:34:55,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-03-16 18:34:55,033 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2329 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 4641 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2414 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 5155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 4641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:55,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2414 Valid, 2719 Invalid, 5155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 4641 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 18:34:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2025-03-16 18:34:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1288. [2025-03-16 18:34:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1005 states have (on average 1.6467661691542288) internal successors, (1655), 1046 states have internal predecessors, (1655), 214 states have call successors, (214), 61 states have call predecessors, (214), 68 states have return successors, (235), 206 states have call predecessors, (235), 209 states have call successors, (235) [2025-03-16 18:34:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2104 transitions. [2025-03-16 18:34:55,089 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2104 transitions. Word has length 134 [2025-03-16 18:34:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 2104 transitions. [2025-03-16 18:34:55,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 6 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-16 18:34:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2104 transitions. [2025-03-16 18:34:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 18:34:55,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:55,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2025-03-16 18:34:55,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 18:34:55,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-16 18:34:55,292 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1525850571, now seen corresponding path program 1 times [2025-03-16 18:34:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805258144] [2025-03-16 18:34:55,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:55,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 18:34:55,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 18:34:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:34:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:55,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805258144] [2025-03-16 18:34:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805258144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:55,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11650242] [2025-03-16 18:34:55,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:55,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:55,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:55,530 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:55,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 18:34:55,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 18:34:55,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 18:34:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:55,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:55,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 18:34:55,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:34:55,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:55,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11650242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-16 18:34:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209255964] [2025-03-16 18:34:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:55,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:55,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:55,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:34:55,861 INFO L87 Difference]: Start difference. First operand 1288 states and 2104 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-16 18:34:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:57,482 INFO L93 Difference]: Finished difference Result 2793 states and 4586 transitions. [2025-03-16 18:34:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:34:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 136 [2025-03-16 18:34:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:57,491 INFO L225 Difference]: With dead ends: 2793 [2025-03-16 18:34:57,491 INFO L226 Difference]: Without dead ends: 1545 [2025-03-16 18:34:57,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:34:57,495 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2079 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2163 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:57,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2163 Valid, 2002 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 3313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 18:34:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-03-16 18:34:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1359. [2025-03-16 18:34:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1057 states have (on average 1.6338694418164617) internal successors, (1727), 1104 states have internal predecessors, (1727), 222 states have call successors, (222), 66 states have call predecessors, (222), 79 states have return successors, (261), 214 states have call predecessors, (261), 217 states have call successors, (261) [2025-03-16 18:34:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2210 transitions. [2025-03-16 18:34:57,572 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2210 transitions. Word has length 136 [2025-03-16 18:34:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2210 transitions. [2025-03-16 18:34:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-16 18:34:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2210 transitions. [2025-03-16 18:34:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 18:34:57,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:57,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:57,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 18:34:57,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:57,780 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:57,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:57,781 INFO L85 PathProgramCache]: Analyzing trace with hash -45698852, now seen corresponding path program 1 times [2025-03-16 18:34:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:57,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070497602] [2025-03-16 18:34:57,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 18:34:57,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 18:34:57,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:57,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:34:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070497602] [2025-03-16 18:34:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070497602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924692772] [2025-03-16 18:34:57,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:57,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:57,997 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:57,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 18:34:58,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 18:34:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 18:34:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:58,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:34:58,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:34:58,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924692772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-16 18:34:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030960670] [2025-03-16 18:34:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:58,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:34:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:58,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:34:58,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:34:58,216 INFO L87 Difference]: Start difference. First operand 1359 states and 2210 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:34:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:58,285 INFO L93 Difference]: Finished difference Result 3375 states and 5550 transitions. [2025-03-16 18:34:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:34:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-16 18:34:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:58,294 INFO L225 Difference]: With dead ends: 3375 [2025-03-16 18:34:58,294 INFO L226 Difference]: Without dead ends: 2059 [2025-03-16 18:34:58,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:34:58,299 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 786 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:58,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2327 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2025-03-16 18:34:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1355. [2025-03-16 18:34:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1055 states have (on average 1.633175355450237) internal successors, (1723), 1100 states have internal predecessors, (1723), 222 states have call successors, (222), 66 states have call predecessors, (222), 77 states have return successors, (252), 214 states have call predecessors, (252), 217 states have call successors, (252) [2025-03-16 18:34:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2197 transitions. [2025-03-16 18:34:58,357 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2197 transitions. Word has length 141 [2025-03-16 18:34:58,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:58,358 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2197 transitions. [2025-03-16 18:34:58,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:34:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2197 transitions. [2025-03-16 18:34:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 18:34:58,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:58,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 18:34:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 18:34:58,562 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 78374395, now seen corresponding path program 1 times [2025-03-16 18:34:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323758762] [2025-03-16 18:34:58,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:58,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 18:34:58,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 18:34:58,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:58,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:34:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323758762] [2025-03-16 18:34:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323758762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:34:58,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804132391] [2025-03-16 18:34:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:58,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:34:58,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:58,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:34:58,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 18:34:58,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 18:34:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 18:34:58,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:58,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:58,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:34:58,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:34:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:34:59,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:34:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804132391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:34:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:34:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194285443] [2025-03-16 18:34:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:59,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:59,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:59,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:34:59,066 INFO L87 Difference]: Start difference. First operand 1355 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:00,160 INFO L93 Difference]: Finished difference Result 4248 states and 7006 transitions. [2025-03-16 18:35:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 141 [2025-03-16 18:35:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:00,173 INFO L225 Difference]: With dead ends: 4248 [2025-03-16 18:35:00,173 INFO L226 Difference]: Without dead ends: 2933 [2025-03-16 18:35:00,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:00,178 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 1859 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:00,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 902 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:35:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2025-03-16 18:35:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2823. [2025-03-16 18:35:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2170 states have (on average 1.6345622119815668) internal successors, (3547), 2270 states have internal predecessors, (3547), 495 states have call successors, (495), 127 states have call predecessors, (495), 157 states have return successors, (607), 487 states have call predecessors, (607), 490 states have call successors, (607) [2025-03-16 18:35:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4649 transitions. [2025-03-16 18:35:00,306 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4649 transitions. Word has length 141 [2025-03-16 18:35:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:00,306 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 4649 transitions. [2025-03-16 18:35:00,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4649 transitions. [2025-03-16 18:35:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 18:35:00,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:00,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:00,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 18:35:00,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 18:35:00,511 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1865533110, now seen corresponding path program 1 times [2025-03-16 18:35:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070357382] [2025-03-16 18:35:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:00,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 18:35:00,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 18:35:00,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:00,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:35:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070357382] [2025-03-16 18:35:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070357382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481897262] [2025-03-16 18:35:00,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:00,695 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:00,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 18:35:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 18:35:00,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 18:35:00,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:00,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:00,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:35:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:35:01,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:35:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481897262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:35:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:35:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488179582] [2025-03-16 18:35:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:01,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:01,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:01,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:01,040 INFO L87 Difference]: Start difference. First operand 2823 states and 4649 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:02,226 INFO L93 Difference]: Finished difference Result 9077 states and 15266 transitions. [2025-03-16 18:35:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2025-03-16 18:35:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:02,258 INFO L225 Difference]: With dead ends: 9077 [2025-03-16 18:35:02,258 INFO L226 Difference]: Without dead ends: 6294 [2025-03-16 18:35:02,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:02,271 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1866 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:02,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 865 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:35:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6294 states. [2025-03-16 18:35:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6294 to 6059. [2025-03-16 18:35:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6059 states, 4579 states have (on average 1.6302686176020966) internal successors, (7465), 4811 states have internal predecessors, (7465), 1154 states have call successors, (1154), 249 states have call predecessors, (1154), 325 states have return successors, (1556), 1150 states have call predecessors, (1556), 1149 states have call successors, (1556) [2025-03-16 18:35:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6059 states to 6059 states and 10175 transitions. [2025-03-16 18:35:02,542 INFO L78 Accepts]: Start accepts. Automaton has 6059 states and 10175 transitions. Word has length 142 [2025-03-16 18:35:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:02,542 INFO L471 AbstractCegarLoop]: Abstraction has 6059 states and 10175 transitions. [2025-03-16 18:35:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6059 states and 10175 transitions. [2025-03-16 18:35:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 18:35:02,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:02,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:02,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 18:35:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-16 18:35:02,749 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1997127403, now seen corresponding path program 1 times [2025-03-16 18:35:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648462671] [2025-03-16 18:35:02,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:02,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 18:35:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 18:35:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:35:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648462671] [2025-03-16 18:35:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648462671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850496857] [2025-03-16 18:35:02,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:02,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:02,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:02,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:02,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 18:35:03,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 18:35:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 18:35:03,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:03,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:35:03,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:35:03,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:35:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850496857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:03,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:35:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:35:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187077128] [2025-03-16 18:35:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:03,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:03,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:03,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:03,248 INFO L87 Difference]: Start difference. First operand 6059 states and 10175 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:04,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:04,765 INFO L93 Difference]: Finished difference Result 19877 states and 34445 transitions. [2025-03-16 18:35:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:04,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2025-03-16 18:35:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:04,843 INFO L225 Difference]: With dead ends: 19877 [2025-03-16 18:35:04,843 INFO L226 Difference]: Without dead ends: 13858 [2025-03-16 18:35:04,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:04,873 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 1854 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:04,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 856 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 18:35:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2025-03-16 18:35:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 13372. [2025-03-16 18:35:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13372 states, 9900 states have (on average 1.622121212121212) internal successors, (16059), 10454 states have internal predecessors, (16059), 2790 states have call successors, (2790), 493 states have call predecessors, (2790), 681 states have return successors, (4230), 2806 states have call predecessors, (4230), 2785 states have call successors, (4230) [2025-03-16 18:35:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13372 states to 13372 states and 23079 transitions. [2025-03-16 18:35:05,539 INFO L78 Accepts]: Start accepts. Automaton has 13372 states and 23079 transitions. Word has length 143 [2025-03-16 18:35:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 13372 states and 23079 transitions. [2025-03-16 18:35:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13372 states and 23079 transitions. [2025-03-16 18:35:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 18:35:05,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:05,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:05,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-16 18:35:05,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 18:35:05,745 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:05,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1781586972, now seen corresponding path program 1 times [2025-03-16 18:35:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231562772] [2025-03-16 18:35:05,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:05,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 18:35:05,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 18:35:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:35:05,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:05,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231562772] [2025-03-16 18:35:05,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231562772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:05,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685718320] [2025-03-16 18:35:05,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:05,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:05,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:05,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:05,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 18:35:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 18:35:06,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 18:35:06,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:06,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:06,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:35:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:35:06,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:35:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685718320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:35:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:35:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443693683] [2025-03-16 18:35:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:06,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:06,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:06,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:06,214 INFO L87 Difference]: Start difference. First operand 13372 states and 23079 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:08,768 INFO L93 Difference]: Finished difference Result 44626 states and 81044 transitions. [2025-03-16 18:35:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:08,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 144 [2025-03-16 18:35:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:08,998 INFO L225 Difference]: With dead ends: 44626 [2025-03-16 18:35:08,998 INFO L226 Difference]: Without dead ends: 31294 [2025-03-16 18:35:09,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:09,075 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 1839 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:09,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 853 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:35:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31294 states. [2025-03-16 18:35:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31294 to 30361. [2025-03-16 18:35:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30361 states, 21965 states have (on average 1.6111541088094696) internal successors, (35389), 23317 states have internal predecessors, (35389), 6950 states have call successors, (6950), 981 states have call predecessors, (6950), 1445 states have return successors, (12152), 7042 states have call predecessors, (12152), 6945 states have call successors, (12152) [2025-03-16 18:35:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30361 states to 30361 states and 54491 transitions. [2025-03-16 18:35:11,189 INFO L78 Accepts]: Start accepts. Automaton has 30361 states and 54491 transitions. Word has length 144 [2025-03-16 18:35:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 30361 states and 54491 transitions. [2025-03-16 18:35:11,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30361 states and 54491 transitions. [2025-03-16 18:35:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-16 18:35:11,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:11,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:11,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-16 18:35:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:11,395 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 605195311, now seen corresponding path program 1 times [2025-03-16 18:35:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627475220] [2025-03-16 18:35:11,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:11,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 18:35:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 18:35:11,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:11,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 18:35:11,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627475220] [2025-03-16 18:35:11,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627475220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98830320] [2025-03-16 18:35:11,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:11,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:11,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:11,572 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:11,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 18:35:11,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-16 18:35:11,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-16 18:35:11,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:11,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 18:35:11,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 18:35:12,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:35:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98830320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:35:12,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:35:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378136391] [2025-03-16 18:35:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:12,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:12,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:12,029 INFO L87 Difference]: Start difference. First operand 30361 states and 54491 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:16,747 INFO L93 Difference]: Finished difference Result 102806 states and 200992 transitions. [2025-03-16 18:35:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 145 [2025-03-16 18:35:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:17,312 INFO L225 Difference]: With dead ends: 102806 [2025-03-16 18:35:17,312 INFO L226 Difference]: Without dead ends: 72475 [2025-03-16 18:35:17,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:17,476 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1813 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1887 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:17,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1887 Valid, 951 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 18:35:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72475 states. [2025-03-16 18:35:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72475 to 70896. [2025-03-16 18:35:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70896 states, 50056 states have (on average 1.5982699376698097) internal successors, (80003), 53414 states have internal predecessors, (80003), 17730 states have call successors, (17730), 1954 states have call predecessors, (17730), 3109 states have return successors, (36857), 18081 states have call predecessors, (36857), 17725 states have call successors, (36857) [2025-03-16 18:35:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70896 states to 70896 states and 134590 transitions. [2025-03-16 18:35:23,022 INFO L78 Accepts]: Start accepts. Automaton has 70896 states and 134590 transitions. Word has length 145 [2025-03-16 18:35:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:23,023 INFO L471 AbstractCegarLoop]: Abstraction has 70896 states and 134590 transitions. [2025-03-16 18:35:23,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:35:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 70896 states and 134590 transitions. [2025-03-16 18:35:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 18:35:23,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:23,234 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:23,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-16 18:35:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 18:35:23,435 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 991297813, now seen corresponding path program 1 times [2025-03-16 18:35:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472519644] [2025-03-16 18:35:23,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:23,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 18:35:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 18:35:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 18:35:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472519644] [2025-03-16 18:35:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472519644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206166267] [2025-03-16 18:35:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:23,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:23,633 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:23,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-16 18:35:23,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 18:35:23,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 18:35:23,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:23,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:23,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:35:23,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 18:35:23,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:35:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206166267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:35:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-16 18:35:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424745007] [2025-03-16 18:35:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:23,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:23,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:35:23,917 INFO L87 Difference]: Start difference. First operand 70896 states and 134590 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 18:35:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:35:28,638 INFO L93 Difference]: Finished difference Result 144631 states and 284459 transitions. [2025-03-16 18:35:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:35:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 200 [2025-03-16 18:35:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:35:29,168 INFO L225 Difference]: With dead ends: 144631 [2025-03-16 18:35:29,169 INFO L226 Difference]: Without dead ends: 73776 [2025-03-16 18:35:29,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:35:29,553 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 144 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:35:29,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2314 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:35:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73776 states. [2025-03-16 18:35:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73776 to 73392. [2025-03-16 18:35:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73392 states, 52488 states have (on average 1.6132258802011887) internal successors, (84675), 55846 states have internal predecessors, (84675), 17730 states have call successors, (17730), 2018 states have call predecessors, (17730), 3173 states have return successors, (36857), 18081 states have call predecessors, (36857), 17725 states have call successors, (36857) [2025-03-16 18:35:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73392 states to 73392 states and 139262 transitions. [2025-03-16 18:35:34,503 INFO L78 Accepts]: Start accepts. Automaton has 73392 states and 139262 transitions. Word has length 200 [2025-03-16 18:35:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:34,503 INFO L471 AbstractCegarLoop]: Abstraction has 73392 states and 139262 transitions. [2025-03-16 18:35:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-16 18:35:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 73392 states and 139262 transitions. [2025-03-16 18:35:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 18:35:34,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:34,518 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:34,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-16 18:35:34,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:34,719 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:34,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 169188323, now seen corresponding path program 1 times [2025-03-16 18:35:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356182489] [2025-03-16 18:35:34,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:34,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 18:35:34,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 18:35:34,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:34,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 18:35:34,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:34,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356182489] [2025-03-16 18:35:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356182489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:35:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798197792] [2025-03-16 18:35:34,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:34,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:35:34,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:35:34,973 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:35:34,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-16 18:35:35,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 18:35:35,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 18:35:35,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:35,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:35,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 2398 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:35:35,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:35:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-16 18:35:35,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:35:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-16 18:35:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798197792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:35:36,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:35:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-03-16 18:35:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001234328] [2025-03-16 18:35:36,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:35:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 18:35:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:36,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 18:35:36,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:35:36,277 INFO L87 Difference]: Start difference. First operand 73392 states and 139262 transitions. Second operand has 25 states, 25 states have (on average 16.24) internal successors, (406), 23 states have internal predecessors, (406), 14 states have call successors, (92), 8 states have call predecessors, (92), 15 states have return successors, (94), 18 states have call predecessors, (94), 13 states have call successors, (94)