./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product31.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_spec14_product31.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 866b4070887ce539f36e137c6ed6e587ee3f43d9563c34ef0dd3382aa4e2313a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:31:41,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:31:41,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:31:41,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:31:41,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:31:41,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:31:41,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:31:41,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:31:41,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:31:41,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:31:41,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:31:41,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:31:41,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:31:41,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:31:41,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:31:41,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:31:41,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:31:41,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:31:41,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:31:41,148 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 -> 866b4070887ce539f36e137c6ed6e587ee3f43d9563c34ef0dd3382aa4e2313a [2025-03-16 18:31:41,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:31:41,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:31:41,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:31:41,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:31:41,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:31:41,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product31.cil.c [2025-03-16 18:31:42,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13e11fc7/cc9af6a3ff80422dadfd1cfb9ced6803/FLAGa9e574f83 [2025-03-16 18:31:42,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:31:42,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product31.cil.c [2025-03-16 18:31:42,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13e11fc7/cc9af6a3ff80422dadfd1cfb9ced6803/FLAGa9e574f83 [2025-03-16 18:31:42,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d13e11fc7/cc9af6a3ff80422dadfd1cfb9ced6803 [2025-03-16 18:31:42,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:31:42,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:31:42,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:31:42,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:31:42,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:31:42,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:31:42" (1/1) ... [2025-03-16 18:31:42,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a274b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:42, skipping insertion in model container [2025-03-16 18:31:42,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:31:42" (1/1) ... [2025-03-16 18:31:42,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:31:43,345 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_spec14_product31.cil.c[71150,71163] [2025-03-16 18:31:43,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:31:43,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:31:43,365 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-16 18:31:43,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [716] [2025-03-16 18:31:43,366 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1082] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1183] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1221] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1341] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2956] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3305] [2025-03-16 18:31:43,367 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3342] [2025-03-16 18:31:43,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3351] [2025-03-16 18:31:43,448 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_spec14_product31.cil.c[71150,71163] [2025-03-16 18:31:43,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:31:43,471 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:31:43,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43 WrapperNode [2025-03-16 18:31:43,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:31:43,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:31:43,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:31:43,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:31:43,477 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:31:43" (1/1) ... [2025-03-16 18:31:43,501 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:31:43" (1/1) ... [2025-03-16 18:31:43,550 INFO L138 Inliner]: procedures = 94, calls = 342, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 894 [2025-03-16 18:31:43,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:31:43,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:31:43,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:31:43,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:31:43,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,604 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:31:43,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:31:43,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:31:43,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:31:43,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:31:43,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (1/1) ... [2025-03-16 18:31:43,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:31:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:43,666 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:31:43,669 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:31:43,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:31:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-16 18:31:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-16 18:31:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-16 18:31:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-16 18:31:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:31:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:31:43,685 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:31:43,685 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:31:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-16 18:31:43,686 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-16 18:31:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:31:43,686 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:31:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-16 18:31:43,686 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-16 18:31:43,686 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:31:43,686 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:31:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:31:43,687 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:31:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:31:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:31:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:31:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:31:43,688 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:31:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-16 18:31:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:31:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:31:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:31:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:31:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:31:43,689 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:31:43,834 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:31:43,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:31:43,918 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~23#1; [2025-03-16 18:31:43,919 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2315: #res#1 := ~retValue_acc~24#1; [2025-03-16 18:31:43,941 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: #res := ~retValue_acc~10; [2025-03-16 18:31:43,960 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~8; [2025-03-16 18:31:43,965 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418: #res := ~retValue_acc~11; [2025-03-16 18:31:43,974 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: #res := ~retValue_acc~12; [2025-03-16 18:31:44,013 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944: #res := ~retValue_acc~28; [2025-03-16 18:31:44,158 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2168-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~20#1; [2025-03-16 18:31:44,159 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: #res#1 := ~retValue_acc~21#1; [2025-03-16 18:31:44,159 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~22#1; [2025-03-16 18:31:44,223 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: #res := ~retValue_acc~26; [2025-03-16 18:31:44,235 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: #res := ~retValue_acc~9; [2025-03-16 18:31:44,340 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: #res := ~retValue_acc~19; [2025-03-16 18:31:44,350 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1634: #res := ~retValue_acc~14; [2025-03-16 18:31:44,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1683-1: isEmpty_#res#1 := isEmpty_~retValue_acc~16#1; [2025-03-16 18:31:44,440 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~17#1; [2025-03-16 18:31:44,440 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1776-1: isIdle_#res#1 := isIdle_~retValue_acc~18#1; [2025-03-16 18:31:44,534 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953-1: isExecutiveFloor_#res#1 := isExecutiveFloor_~retValue_acc~29#1; [2025-03-16 18:31:44,535 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~13#1; [2025-03-16 18:31:44,535 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-16 18:31:44,585 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-16 18:31:44,632 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1218-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-16 18:31:44,632 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302-1: main_#res#1 := main_~retValue_acc~31#1; [2025-03-16 18:31:44,643 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-16 18:31:44,646 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-16 18:31:44,773 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2025-03-16 18:31:44,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:31:44,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:31:44,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:31:44,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:31:44 BoogieIcfgContainer [2025-03-16 18:31:44,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:31:44,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:31:44,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:31:44,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:31:44,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:31:42" (1/3) ... [2025-03-16 18:31:44,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517be351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:31:44, skipping insertion in model container [2025-03-16 18:31:44,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:31:43" (2/3) ... [2025-03-16 18:31:44,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517be351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:31:44, skipping insertion in model container [2025-03-16 18:31:44,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:31:44" (3/3) ... [2025-03-16 18:31:44,806 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product31.cil.c [2025-03-16 18:31:44,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:31:44,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product31.cil.c that has 26 procedures, 559 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:31:44,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:31:44,882 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;@6e9be31a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:31:44,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:31:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 433 states have (on average 1.6789838337182448) internal successors, (727), 449 states have internal predecessors, (727), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-16 18:31:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:31:44,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:44,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:44,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:44,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 523790434, now seen corresponding path program 1 times [2025-03-16 18:31:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688381288] [2025-03-16 18:31:44,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:44,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:31:45,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:31:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:45,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:45,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688381288] [2025-03-16 18:31:45,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688381288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:45,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:45,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969740597] [2025-03-16 18:31:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:45,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:45,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:45,352 INFO L87 Difference]: Start difference. First operand has 559 states, 433 states have (on average 1.6789838337182448) internal successors, (727), 449 states have internal predecessors, (727), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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:31:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:45,512 INFO L93 Difference]: Finished difference Result 1116 states and 1855 transitions. [2025-03-16 18:31:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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:31:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:45,528 INFO L225 Difference]: With dead ends: 1116 [2025-03-16 18:31:45,528 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:31:45,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:31:45,539 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 6 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:45,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2724 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:31:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:31:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 431 states have (on average 1.668213457076566) internal successors, (719), 446 states have internal predecessors, (719), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 916 transitions. [2025-03-16 18:31:45,621 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 916 transitions. Word has length 99 [2025-03-16 18:31:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:45,622 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 916 transitions. [2025-03-16 18:31:45,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (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:31:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 916 transitions. [2025-03-16 18:31:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 18:31:45,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:45,630 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:31:45,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:45,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1794613450, now seen corresponding path program 1 times [2025-03-16 18:31:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:45,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703843564] [2025-03-16 18:31:45,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:45,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:45,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 18:31:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 18:31:45,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:45,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:45,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:45,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703843564] [2025-03-16 18:31:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703843564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136050743] [2025-03-16 18:31:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:45,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:45,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:45,796 INFO L87 Difference]: Start difference. First operand 556 states and 916 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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:31:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:45,876 INFO L93 Difference]: Finished difference Result 1099 states and 1813 transitions. [2025-03-16 18:31:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:31:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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:31:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:45,881 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:31:45,884 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:31:45,886 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:31:45,887 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 4 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:45,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2699 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:31:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:31:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 431 states have (on average 1.665893271461717) internal successors, (718), 446 states have internal predecessors, (718), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 915 transitions. [2025-03-16 18:31:45,913 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 915 transitions. Word has length 100 [2025-03-16 18:31:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:45,914 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 915 transitions. [2025-03-16 18:31:45,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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:31:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 915 transitions. [2025-03-16 18:31:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:31:45,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:45,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:31:45,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:45,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 218569023, now seen corresponding path program 1 times [2025-03-16 18:31:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963482775] [2025-03-16 18:31:45,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:31:45,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:31:45,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:45,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963482775] [2025-03-16 18:31:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963482775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915267732] [2025-03-16 18:31:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:46,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:46,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:46,068 INFO L87 Difference]: Start difference. First operand 556 states and 915 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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:31:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:46,127 INFO L93 Difference]: Finished difference Result 1099 states and 1812 transitions. [2025-03-16 18:31:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:31:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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:31:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:46,134 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:31:46,134 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:31:46,137 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:31:46,138 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 3 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:46,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2699 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:31:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:31:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 431 states have (on average 1.6635730858468678) internal successors, (717), 446 states have internal predecessors, (717), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 914 transitions. [2025-03-16 18:31:46,169 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 914 transitions. Word has length 101 [2025-03-16 18:31:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:46,169 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 914 transitions. [2025-03-16 18:31:46,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (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:31:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 914 transitions. [2025-03-16 18:31:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:31:46,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:46,173 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:31:46,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -928024909, now seen corresponding path program 1 times [2025-03-16 18:31:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467444228] [2025-03-16 18:31:46,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:46,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:31:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:31:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467444228] [2025-03-16 18:31:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467444228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838067337] [2025-03-16 18:31:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:46,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:46,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:46,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:46,282 INFO L87 Difference]: Start difference. First operand 556 states and 914 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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:31:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:46,342 INFO L93 Difference]: Finished difference Result 1099 states and 1811 transitions. [2025-03-16 18:31:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:31:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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:31:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:46,346 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:31:46,347 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:31:46,350 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:31:46,353 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 2 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2699 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:31:46,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2699 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:31:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:31:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 431 states have (on average 1.6612529002320187) internal successors, (716), 446 states have internal predecessors, (716), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 913 transitions. [2025-03-16 18:31:46,379 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 913 transitions. Word has length 102 [2025-03-16 18:31:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:46,379 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 913 transitions. [2025-03-16 18:31:46,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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:31:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 913 transitions. [2025-03-16 18:31:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:31:46,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:46,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:31:46,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:46,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1243439588, now seen corresponding path program 1 times [2025-03-16 18:31:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865793648] [2025-03-16 18:31:46,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:46,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:31:46,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:31:46,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:46,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:46,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865793648] [2025-03-16 18:31:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865793648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:46,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139029047] [2025-03-16 18:31:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:46,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:46,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:46,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:46,498 INFO L87 Difference]: Start difference. First operand 556 states and 913 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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:31:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:46,551 INFO L93 Difference]: Finished difference Result 1099 states and 1810 transitions. [2025-03-16 18:31:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:31:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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:31:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:46,556 INFO L225 Difference]: With dead ends: 1099 [2025-03-16 18:31:46,556 INFO L226 Difference]: Without dead ends: 556 [2025-03-16 18:31:46,559 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:31:46,561 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 1 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2699 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:46,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2699 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-16 18:31:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-16 18:31:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 431 states have (on average 1.6589327146171693) internal successors, (715), 446 states have internal predecessors, (715), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 912 transitions. [2025-03-16 18:31:46,589 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 912 transitions. Word has length 103 [2025-03-16 18:31:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:46,590 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 912 transitions. [2025-03-16 18:31:46,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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:31:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 912 transitions. [2025-03-16 18:31:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 18:31:46,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:46,593 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:31:46,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1562101200, now seen corresponding path program 1 times [2025-03-16 18:31:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927491305] [2025-03-16 18:31:46,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:46,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 18:31:46,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 18:31:46,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:46,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927491305] [2025-03-16 18:31:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927491305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:31:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185368309] [2025-03-16 18:31:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:31:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:46,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:31:46,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:31:46,824 INFO L87 Difference]: Start difference. First operand 556 states and 912 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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:31:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:46,948 INFO L93 Difference]: Finished difference Result 1110 states and 1827 transitions. [2025-03-16 18:31:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:31:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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 104 [2025-03-16 18:31:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:46,953 INFO L225 Difference]: With dead ends: 1110 [2025-03-16 18:31:46,953 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 18:31:46,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:46,956 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 91 mSDsluCounter, 6192 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7089 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:46,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7089 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 18:31:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2025-03-16 18:31:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 441 states have (on average 1.655328798185941) internal successors, (730), 458 states have internal predecessors, (730), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (102), 97 states have call predecessors, (102), 99 states have call successors, (102) [2025-03-16 18:31:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 932 transitions. [2025-03-16 18:31:46,978 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 932 transitions. Word has length 104 [2025-03-16 18:31:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:46,979 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 932 transitions. [2025-03-16 18:31:46,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 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:31:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 932 transitions. [2025-03-16 18:31:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 18:31:46,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:46,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:31:46,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1576351345, now seen corresponding path program 1 times [2025-03-16 18:31:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857293018] [2025-03-16 18:31:46,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:46,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 18:31:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 18:31:47,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:47,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:47,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:47,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857293018] [2025-03-16 18:31:47,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857293018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:47,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:47,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731085574] [2025-03-16 18:31:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:47,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:47,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:47,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:47,053 INFO L87 Difference]: Start difference. First operand 569 states and 932 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:31:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:47,095 INFO L93 Difference]: Finished difference Result 1117 states and 1838 transitions. [2025-03-16 18:31:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:47,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 104 [2025-03-16 18:31:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:47,099 INFO L225 Difference]: With dead ends: 1117 [2025-03-16 18:31:47,099 INFO L226 Difference]: Without dead ends: 565 [2025-03-16 18:31:47,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:31:47,101 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 1 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:47,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2694 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-16 18:31:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-03-16 18:31:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 439 states have (on average 1.6560364464692483) internal successors, (727), 455 states have internal predecessors, (727), 99 states have call successors, (99), 26 states have call predecessors, (99), 26 states have return successors, (99), 96 states have call predecessors, (99), 98 states have call successors, (99) [2025-03-16 18:31:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 925 transitions. [2025-03-16 18:31:47,116 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 925 transitions. Word has length 104 [2025-03-16 18:31:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:47,116 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 925 transitions. [2025-03-16 18:31:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:31:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 925 transitions. [2025-03-16 18:31:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:31:47,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:47,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:47,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:31:47,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:47,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2097510173, now seen corresponding path program 1 times [2025-03-16 18:31:47,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:47,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270540996] [2025-03-16 18:31:47,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:47,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:47,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:31:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:31:47,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:47,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:47,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:47,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270540996] [2025-03-16 18:31:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270540996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:47,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:47,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:31:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045350579] [2025-03-16 18:31:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:47,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:31:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:47,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:31:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:31:47,226 INFO L87 Difference]: Start difference. First operand 565 states and 925 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (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:31:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:47,422 INFO L93 Difference]: Finished difference Result 1160 states and 1910 transitions. [2025-03-16 18:31:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:31:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (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:31:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:47,426 INFO L225 Difference]: With dead ends: 1160 [2025-03-16 18:31:47,426 INFO L226 Difference]: Without dead ends: 597 [2025-03-16 18:31:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:31:47,428 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 72 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4291 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:47,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4291 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:31:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-16 18:31:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 570. [2025-03-16 18:31:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 444 states have (on average 1.6418918918918919) internal successors, (729), 459 states have internal predecessors, (729), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 926 transitions. [2025-03-16 18:31:47,443 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 926 transitions. Word has length 105 [2025-03-16 18:31:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:47,444 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 926 transitions. [2025-03-16 18:31:47,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (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:31:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 926 transitions. [2025-03-16 18:31:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:31:47,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:47,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:47,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:31:47,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash -110224217, now seen corresponding path program 1 times [2025-03-16 18:31:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:47,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981187799] [2025-03-16 18:31:47,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:47,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 18:31:47,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:31:47,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:47,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:47,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:47,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981187799] [2025-03-16 18:31:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981187799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:31:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076310016] [2025-03-16 18:31:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:47,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:31:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:47,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:31:47,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:31:47,545 INFO L87 Difference]: Start difference. First operand 570 states and 926 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (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:31:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:47,711 INFO L93 Difference]: Finished difference Result 1111 states and 1805 transitions. [2025-03-16 18:31:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (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:31:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:47,715 INFO L225 Difference]: With dead ends: 1111 [2025-03-16 18:31:47,715 INFO L226 Difference]: Without dead ends: 588 [2025-03-16 18:31:47,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:31:47,721 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 56 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:47,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4268 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-16 18:31:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 570. [2025-03-16 18:31:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 444 states have (on average 1.632882882882883) internal successors, (725), 459 states have internal predecessors, (725), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 922 transitions. [2025-03-16 18:31:47,737 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 922 transitions. Word has length 106 [2025-03-16 18:31:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:47,737 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 922 transitions. [2025-03-16 18:31:47,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (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:31:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 922 transitions. [2025-03-16 18:31:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:31:47,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:47,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:47,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:31:47,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2115430822, now seen corresponding path program 1 times [2025-03-16 18:31:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613776255] [2025-03-16 18:31:47,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:47,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:31:47,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:31:47,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:47,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613776255] [2025-03-16 18:31:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613776255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:31:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643336846] [2025-03-16 18:31:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:31:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:31:47,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:31:47,844 INFO L87 Difference]: Start difference. First operand 570 states and 922 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (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:31:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:47,991 INFO L93 Difference]: Finished difference Result 1111 states and 1801 transitions. [2025-03-16 18:31:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:47,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (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:31:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:47,995 INFO L225 Difference]: With dead ends: 1111 [2025-03-16 18:31:47,995 INFO L226 Difference]: Without dead ends: 588 [2025-03-16 18:31:47,997 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:31:47,998 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 55 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4263 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:47,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4263 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-16 18:31:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 570. [2025-03-16 18:31:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 444 states have (on average 1.6238738738738738) internal successors, (721), 459 states have internal predecessors, (721), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 918 transitions. [2025-03-16 18:31:48,014 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 918 transitions. Word has length 107 [2025-03-16 18:31:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:48,014 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 918 transitions. [2025-03-16 18:31:48,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (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:31:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 918 transitions. [2025-03-16 18:31:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:31:48,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:48,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:31:48,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:48,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash -304702635, now seen corresponding path program 1 times [2025-03-16 18:31:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:48,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024756580] [2025-03-16 18:31:48,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:48,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:31:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:31:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024756580] [2025-03-16 18:31:48,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024756580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:48,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:48,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:31:48,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669762701] [2025-03-16 18:31:48,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:48,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:31:48,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:48,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:31:48,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:31:48,120 INFO L87 Difference]: Start difference. First operand 570 states and 918 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:31:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:48,187 INFO L93 Difference]: Finished difference Result 1102 states and 1783 transitions. [2025-03-16 18:31:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:31:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 107 [2025-03-16 18:31:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:48,192 INFO L225 Difference]: With dead ends: 1102 [2025-03-16 18:31:48,192 INFO L226 Difference]: Without dead ends: 558 [2025-03-16 18:31:48,194 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:31:48,195 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 94 mSDsluCounter, 4344 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 5232 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:48,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 5232 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-16 18:31:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 549. [2025-03-16 18:31:48,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 423 states have (on average 1.6170212765957446) internal successors, (684), 438 states have internal predecessors, (684), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 881 transitions. [2025-03-16 18:31:48,212 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 881 transitions. Word has length 107 [2025-03-16 18:31:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:48,213 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 881 transitions. [2025-03-16 18:31:48,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:31:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 881 transitions. [2025-03-16 18:31:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:31:48,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:48,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:31:48,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:48,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1154374454, now seen corresponding path program 1 times [2025-03-16 18:31:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:48,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516305697] [2025-03-16 18:31:48,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:48,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 18:31:48,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:31:48,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:48,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:48,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516305697] [2025-03-16 18:31:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516305697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:31:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445438144] [2025-03-16 18:31:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:48,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:31:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:48,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:31:48,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:31:48,326 INFO L87 Difference]: Start difference. First operand 549 states and 881 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (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:31:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:48,416 INFO L93 Difference]: Finished difference Result 1081 states and 1746 transitions. [2025-03-16 18:31:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:48,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (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:31:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:48,420 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:31:48,421 INFO L226 Difference]: Without dead ends: 558 [2025-03-16 18:31:48,423 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:31:48,424 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 39 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:48,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4268 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-16 18:31:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 549. [2025-03-16 18:31:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 423 states have (on average 1.6146572104018913) internal successors, (683), 438 states have internal predecessors, (683), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 880 transitions. [2025-03-16 18:31:48,445 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 880 transitions. Word has length 108 [2025-03-16 18:31:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:48,445 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 880 transitions. [2025-03-16 18:31:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (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:31:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 880 transitions. [2025-03-16 18:31:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 18:31:48,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:48,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:31:48,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1310209641, now seen corresponding path program 1 times [2025-03-16 18:31:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545104353] [2025-03-16 18:31:48,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:48,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 18:31:48,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 18:31:48,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:48,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:48,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:48,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545104353] [2025-03-16 18:31:48,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545104353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:48,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:48,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:31:48,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574580627] [2025-03-16 18:31:48,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:48,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:31:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:48,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:31:48,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:31:48,574 INFO L87 Difference]: Start difference. First operand 549 states and 880 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:31:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:48,654 INFO L93 Difference]: Finished difference Result 1081 states and 1745 transitions. [2025-03-16 18:31:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 109 [2025-03-16 18:31:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:48,658 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:31:48,659 INFO L226 Difference]: Without dead ends: 558 [2025-03-16 18:31:48,661 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:31:48,662 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 38 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4268 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:48,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4268 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-16 18:31:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 549. [2025-03-16 18:31:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 423 states have (on average 1.612293144208038) internal successors, (682), 438 states have internal predecessors, (682), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 879 transitions. [2025-03-16 18:31:48,678 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 879 transitions. Word has length 109 [2025-03-16 18:31:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:48,678 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 879 transitions. [2025-03-16 18:31:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:31:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 879 transitions. [2025-03-16 18:31:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 18:31:48,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:48,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:31:48,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -57004434, now seen corresponding path program 1 times [2025-03-16 18:31:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188073576] [2025-03-16 18:31:48,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:48,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 18:31:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 18:31:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188073576] [2025-03-16 18:31:48,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188073576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:31:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560161391] [2025-03-16 18:31:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:48,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:48,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:31:48,752 INFO L87 Difference]: Start difference. First operand 549 states and 879 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:31:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:48,800 INFO L93 Difference]: Finished difference Result 1081 states and 1744 transitions. [2025-03-16 18:31:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:48,801 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 110 [2025-03-16 18:31:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:48,804 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 18:31:48,804 INFO L226 Difference]: Without dead ends: 558 [2025-03-16 18:31:48,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:31:48,807 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 45 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:48,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2532 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-16 18:31:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 549. [2025-03-16 18:31:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 423 states have (on average 1.6099290780141844) internal successors, (681), 438 states have internal predecessors, (681), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 878 transitions. [2025-03-16 18:31:48,822 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 878 transitions. Word has length 110 [2025-03-16 18:31:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:48,822 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 878 transitions. [2025-03-16 18:31:48,822 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:31:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 878 transitions. [2025-03-16 18:31:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 18:31:48,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:48,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:31:48,825 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:48,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:48,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1152237805, now seen corresponding path program 1 times [2025-03-16 18:31:48,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:48,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948833129] [2025-03-16 18:31:48,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:48,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:48,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 18:31:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 18:31:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:31:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948833129] [2025-03-16 18:31:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948833129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:31:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:31:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462621954] [2025-03-16 18:31:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:31:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:48,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:31:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:48,991 INFO L87 Difference]: Start difference. First operand 549 states and 878 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:31:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:49,131 INFO L93 Difference]: Finished difference Result 1071 states and 1726 transitions. [2025-03-16 18:31:49,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:31:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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 110 [2025-03-16 18:31:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:49,135 INFO L225 Difference]: With dead ends: 1071 [2025-03-16 18:31:49,135 INFO L226 Difference]: Without dead ends: 554 [2025-03-16 18:31:49,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:49,139 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 20 mSDsluCounter, 6642 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:49,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-16 18:31:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2025-03-16 18:31:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 425 states have (on average 1.6047058823529412) internal successors, (682), 440 states have internal predecessors, (682), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:31:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 879 transitions. [2025-03-16 18:31:49,155 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 879 transitions. Word has length 110 [2025-03-16 18:31:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:49,155 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 879 transitions. [2025-03-16 18:31:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 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:31:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 879 transitions. [2025-03-16 18:31:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 18:31:49,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:49,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:31:49,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1060993188, now seen corresponding path program 1 times [2025-03-16 18:31:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234504171] [2025-03-16 18:31:49,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:49,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 18:31:49,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 18:31:49,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:49,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:31:49,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:49,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234504171] [2025-03-16 18:31:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234504171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360019834] [2025-03-16 18:31:49,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:49,250 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:31:49,252 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:31:49,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 18:31:49,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 18:31:49,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:49,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:49,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:31:49,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:31:49,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360019834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:31:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851351849] [2025-03-16 18:31:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:49,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:49,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:49,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:49,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:31:49,609 INFO L87 Difference]: Start difference. First operand 551 states and 879 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:50,082 INFO L93 Difference]: Finished difference Result 1071 states and 1752 transitions. [2025-03-16 18:31:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-16 18:31:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:50,085 INFO L225 Difference]: With dead ends: 1071 [2025-03-16 18:31:50,085 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 18:31:50,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 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:31:50,088 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 828 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:50,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 2132 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:31:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 18:31:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-16 18:31:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 432 states have (on average 1.6064814814814814) internal successors, (694), 447 states have internal predecessors, (694), 99 states have call successors, (99), 28 states have call predecessors, (99), 27 states have return successors, (99), 96 states have call predecessors, (99), 98 states have call successors, (99) [2025-03-16 18:31:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 892 transitions. [2025-03-16 18:31:50,110 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 892 transitions. Word has length 111 [2025-03-16 18:31:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:50,110 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 892 transitions. [2025-03-16 18:31:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 892 transitions. [2025-03-16 18:31:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 18:31:50,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:50,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:50,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 18:31:50,317 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,SelfDestructingSolverStorable15 [2025-03-16 18:31:50,317 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1136700226, now seen corresponding path program 1 times [2025-03-16 18:31:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093866540] [2025-03-16 18:31:50,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:50,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:31:50,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:31:50,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 18:31:50,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093866540] [2025-03-16 18:31:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093866540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650952376] [2025-03-16 18:31:50,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:50,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:50,415 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:31:50,416 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:31:50,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:31:50,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:31:50,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:50,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:50,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:31:50,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 18:31:50,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650952376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:31:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419961041] [2025-03-16 18:31:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:50,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:50,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:50,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:31:50,745 INFO L87 Difference]: Start difference. First operand 559 states and 892 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:51,183 INFO L93 Difference]: Finished difference Result 1087 states and 1775 transitions. [2025-03-16 18:31:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-16 18:31:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:51,187 INFO L225 Difference]: With dead ends: 1087 [2025-03-16 18:31:51,187 INFO L226 Difference]: Without dead ends: 567 [2025-03-16 18:31:51,190 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:31:51,190 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 815 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:51,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2129 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:31:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-16 18:31:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-03-16 18:31:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 439 states have (on average 1.6082004555808656) internal successors, (706), 454 states have internal predecessors, (706), 99 states have call successors, (99), 29 states have call predecessors, (99), 28 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-03-16 18:31:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 905 transitions. [2025-03-16 18:31:51,208 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 905 transitions. Word has length 114 [2025-03-16 18:31:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:51,209 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 905 transitions. [2025-03-16 18:31:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 905 transitions. [2025-03-16 18:31:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 18:31:51,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:51,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:51,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 18:31:51,412 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,SelfDestructingSolverStorable16 [2025-03-16 18:31:51,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:51,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 706112793, now seen corresponding path program 1 times [2025-03-16 18:31:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:51,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154919506] [2025-03-16 18:31:51,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:51,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 18:31:51,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 18:31:51,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:51,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 18:31:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154919506] [2025-03-16 18:31:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154919506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:51,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419195880] [2025-03-16 18:31:51,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:51,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:51,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:51,516 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:31:51,518 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:31:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 18:31:51,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 18:31:51,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:51,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:51,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:31:51,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 18:31:51,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419195880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:51,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:51,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:31:51,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025737888] [2025-03-16 18:31:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:51,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:51,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:51,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:31:51,822 INFO L87 Difference]: Start difference. First operand 567 states and 905 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:52,224 INFO L93 Difference]: Finished difference Result 1103 states and 1798 transitions. [2025-03-16 18:31:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-16 18:31:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:52,231 INFO L225 Difference]: With dead ends: 1103 [2025-03-16 18:31:52,231 INFO L226 Difference]: Without dead ends: 575 [2025-03-16 18:31:52,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 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:31:52,234 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 814 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:52,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2126 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:31:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-16 18:31:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-03-16 18:31:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 446 states have (on average 1.609865470852018) internal successors, (718), 461 states have internal predecessors, (718), 99 states have call successors, (99), 30 states have call predecessors, (99), 29 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2025-03-16 18:31:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 918 transitions. [2025-03-16 18:31:52,255 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 918 transitions. Word has length 117 [2025-03-16 18:31:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:52,256 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 918 transitions. [2025-03-16 18:31:52,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:31:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 918 transitions. [2025-03-16 18:31:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 18:31:52,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:52,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:52,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:31:52,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 18:31:52,459 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:52,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 935783417, now seen corresponding path program 1 times [2025-03-16 18:31:52,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459109441] [2025-03-16 18:31:52,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 18:31:52,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 18:31:52,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:52,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 18:31:52,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:52,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459109441] [2025-03-16 18:31:52,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459109441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:52,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111769014] [2025-03-16 18:31:52,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:52,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:52,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:52,560 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:31:52,562 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:31:52,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 18:31:52,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 18:31:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:52,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:52,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:31:52,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 18:31:52,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:52,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111769014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:52,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:52,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-16 18:31:52,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347849624] [2025-03-16 18:31:52,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:52,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:52,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:52,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:31:52,875 INFO L87 Difference]: Start difference. First operand 575 states and 918 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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:31:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:53,262 INFO L93 Difference]: Finished difference Result 1119 states and 1821 transitions. [2025-03-16 18:31:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:31:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 120 [2025-03-16 18:31:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:53,266 INFO L225 Difference]: With dead ends: 1119 [2025-03-16 18:31:53,266 INFO L226 Difference]: Without dead ends: 583 [2025-03-16 18:31:53,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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:31:53,269 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 794 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:53,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2123 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:31:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-16 18:31:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-03-16 18:31:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 453 states have (on average 1.6114790286975718) internal successors, (730), 468 states have internal predecessors, (730), 99 states have call successors, (99), 31 states have call predecessors, (99), 30 states have return successors, (102), 96 states have call predecessors, (102), 98 states have call successors, (102) [2025-03-16 18:31:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 931 transitions. [2025-03-16 18:31:53,285 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 931 transitions. Word has length 120 [2025-03-16 18:31:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:53,285 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 931 transitions. [2025-03-16 18:31:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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:31:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 931 transitions. [2025-03-16 18:31:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 18:31:53,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:53,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:53,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:31:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:53,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:53,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1830133846, now seen corresponding path program 1 times [2025-03-16 18:31:53,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259402628] [2025-03-16 18:31:53,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:53,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 18:31:53,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 18:31:53,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:53,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 18:31:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259402628] [2025-03-16 18:31:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259402628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593151986] [2025-03-16 18:31:53,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:53,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:53,646 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:31:53,648 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:31:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 18:31:53,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 18:31:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:53,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:31:53,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:31:54,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:54,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593151986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-16 18:31:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446878599] [2025-03-16 18:31:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:54,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:54,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:54,004 INFO L87 Difference]: Start difference. First operand 583 states and 931 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 3 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:31:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:54,391 INFO L93 Difference]: Finished difference Result 1677 states and 2749 transitions. [2025-03-16 18:31:54,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:31:54,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 3 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 123 [2025-03-16 18:31:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:54,398 INFO L225 Difference]: With dead ends: 1677 [2025-03-16 18:31:54,398 INFO L226 Difference]: Without dead ends: 1133 [2025-03-16 18:31:54,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:31:54,401 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 794 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:54,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 3463 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:31:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-16 18:31:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1125. [2025-03-16 18:31:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 873 states have (on average 1.6242840778923253) internal successors, (1418), 904 states have internal predecessors, (1418), 192 states have call successors, (192), 59 states have call predecessors, (192), 59 states have return successors, (218), 187 states have call predecessors, (218), 190 states have call successors, (218) [2025-03-16 18:31:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1828 transitions. [2025-03-16 18:31:54,451 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1828 transitions. Word has length 123 [2025-03-16 18:31:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:54,453 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1828 transitions. [2025-03-16 18:31:54,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (14), 3 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:31:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1828 transitions. [2025-03-16 18:31:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 18:31:54,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:54,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:54,463 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:31:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:54,660 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 613813559, now seen corresponding path program 1 times [2025-03-16 18:31:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698972719] [2025-03-16 18:31:54,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:54,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:54,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:54,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 18:31:54,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698972719] [2025-03-16 18:31:54,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698972719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:54,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861535605] [2025-03-16 18:31:54,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:54,845 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:31:54,847 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:31:54,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:55,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:55,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:55,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:55,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:31:55,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:31:55,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861535605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-16 18:31:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238675107] [2025-03-16 18:31:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:55,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:31:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:55,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:31:55,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:55,094 INFO L87 Difference]: Start difference. First operand 1125 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:55,157 INFO L93 Difference]: Finished difference Result 2746 states and 4528 transitions. [2025-03-16 18:31:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:31:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-16 18:31:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:55,167 INFO L225 Difference]: With dead ends: 2746 [2025-03-16 18:31:55,167 INFO L226 Difference]: Without dead ends: 1661 [2025-03-16 18:31:55,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:55,173 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 824 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2454 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:31:55,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2454 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-03-16 18:31:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1125. [2025-03-16 18:31:55,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 873 states have (on average 1.6231386025200458) internal successors, (1417), 904 states have internal predecessors, (1417), 192 states have call successors, (192), 59 states have call predecessors, (192), 59 states have return successors, (218), 187 states have call predecessors, (218), 190 states have call successors, (218) [2025-03-16 18:31:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1827 transitions. [2025-03-16 18:31:55,217 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1827 transitions. Word has length 128 [2025-03-16 18:31:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:55,217 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1827 transitions. [2025-03-16 18:31:55,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1827 transitions. [2025-03-16 18:31:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 18:31:55,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:55,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,228 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:31:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:55,420 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:55,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash 964613496, now seen corresponding path program 1 times [2025-03-16 18:31:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:55,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211791108] [2025-03-16 18:31:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:55,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:55,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:55,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:55,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 18:31:55,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211791108] [2025-03-16 18:31:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211791108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754164332] [2025-03-16 18:31:55,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:55,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:55,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:55,577 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:31:55,578 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:31:55,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:55,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:31:55,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:31:55,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754164332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:55,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:55,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-16 18:31:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991054806] [2025-03-16 18:31:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:55,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:31:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:55,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:31:55,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:55,863 INFO L87 Difference]: Start difference. First operand 1125 states and 1827 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:55,955 INFO L93 Difference]: Finished difference Result 2831 states and 4618 transitions. [2025-03-16 18:31:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:55,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-16 18:31:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:55,963 INFO L225 Difference]: With dead ends: 2831 [2025-03-16 18:31:55,963 INFO L226 Difference]: Without dead ends: 1747 [2025-03-16 18:31:55,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:31:55,969 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 382 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:55,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 3696 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2025-03-16 18:31:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2025-03-16 18:31:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1359 states have (on average 1.5967623252391465) internal successors, (2170), 1394 states have internal predecessors, (2170), 288 states have call successors, (288), 99 states have call predecessors, (288), 99 states have return successors, (365), 279 states have call predecessors, (365), 284 states have call successors, (365) [2025-03-16 18:31:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2823 transitions. [2025-03-16 18:31:56,039 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2823 transitions. Word has length 128 [2025-03-16 18:31:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 1747 states and 2823 transitions. [2025-03-16 18:31:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2823 transitions. [2025-03-16 18:31:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 18:31:56,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:56,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:56,051 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:31:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:56,243 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:56,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 356536633, now seen corresponding path program 1 times [2025-03-16 18:31:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048515095] [2025-03-16 18:31:56,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:56,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:56,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 18:31:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048515095] [2025-03-16 18:31:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048515095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501166840] [2025-03-16 18:31:56,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:56,393 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:31:56,395 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:31:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:31:56,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:31:56,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:56,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:56,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 18:31:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:31:56,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501166840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-16 18:31:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63301205] [2025-03-16 18:31:56,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:56,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:31:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:56,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:31:56,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:56,672 INFO L87 Difference]: Start difference. First operand 1747 states and 2823 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:56,720 INFO L93 Difference]: Finished difference Result 3172 states and 5117 transitions. [2025-03-16 18:31:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:31:56,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-16 18:31:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:56,729 INFO L225 Difference]: With dead ends: 3172 [2025-03-16 18:31:56,729 INFO L226 Difference]: Without dead ends: 1466 [2025-03-16 18:31:56,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:31:56,758 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 558 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:56,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:31:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-16 18:31:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2025-03-16 18:31:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1137 states have (on average 1.5787159190853122) internal successors, (1795), 1164 states have internal predecessors, (1795), 241 states have call successors, (241), 89 states have call predecessors, (241), 87 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:31:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2332 transitions. [2025-03-16 18:31:56,808 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2332 transitions. Word has length 128 [2025-03-16 18:31:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:56,809 INFO L471 AbstractCegarLoop]: Abstraction has 1466 states and 2332 transitions. [2025-03-16 18:31:56,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:31:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2332 transitions. [2025-03-16 18:31:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 18:31:56,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:56,813 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-16 18:31:56,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 18:31:57,014 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,SelfDestructingSolverStorable22 [2025-03-16 18:31:57,014 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1999705300, now seen corresponding path program 1 times [2025-03-16 18:31:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175258263] [2025-03-16 18:31:57,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:57,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 18:31:57,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 18:31:57,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:57,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 18:31:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175258263] [2025-03-16 18:31:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175258263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787785572] [2025-03-16 18:31:57,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:57,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:57,166 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:31:57,168 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:31:57,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 18:31:57,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 18:31:57,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:57,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:57,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:31:57,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 18:31:57,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787785572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-16 18:31:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078226156] [2025-03-16 18:31:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:57,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:31:57,415 INFO L87 Difference]: Start difference. First operand 1466 states and 2332 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:57,598 INFO L93 Difference]: Finished difference Result 2981 states and 4801 transitions. [2025-03-16 18:31:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-03-16 18:31:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:57,605 INFO L225 Difference]: With dead ends: 2981 [2025-03-16 18:31:57,605 INFO L226 Difference]: Without dead ends: 1556 [2025-03-16 18:31:57,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:57,610 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 144 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2371 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:31:57,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2371 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-16 18:31:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1544. [2025-03-16 18:31:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1213 states have (on average 1.6001648804616653) internal successors, (1941), 1240 states have internal predecessors, (1941), 241 states have call successors, (241), 91 states have call predecessors, (241), 89 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:31:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2478 transitions. [2025-03-16 18:31:57,675 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2478 transitions. Word has length 151 [2025-03-16 18:31:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:57,676 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2478 transitions. [2025-03-16 18:31:57,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2478 transitions. [2025-03-16 18:31:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 18:31:57,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:57,680 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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] [2025-03-16 18:31:57,687 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:31:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 18:31:57,880 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -681156974, now seen corresponding path program 1 times [2025-03-16 18:31:57,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:57,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140056051] [2025-03-16 18:31:57,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 18:31:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 18:31:57,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:57,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 18:31:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140056051] [2025-03-16 18:31:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140056051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692621984] [2025-03-16 18:31:58,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:58,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:58,068 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:31:58,074 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:31:58,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 18:31:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 18:31:58,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:58,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:31:58,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 18:31:58,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:58,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692621984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:58,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:58,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-16 18:31:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713461938] [2025-03-16 18:31:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:58,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:58,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:31:58,321 INFO L87 Difference]: Start difference. First operand 1544 states and 2478 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:58,471 INFO L93 Difference]: Finished difference Result 3143 states and 5095 transitions. [2025-03-16 18:31:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:58,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 156 [2025-03-16 18:31:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:58,478 INFO L225 Difference]: With dead ends: 3143 [2025-03-16 18:31:58,478 INFO L226 Difference]: Without dead ends: 1640 [2025-03-16 18:31:58,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:58,482 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 142 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:58,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2368 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-16 18:31:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1622. [2025-03-16 18:31:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1289 states have (on average 1.6190845616757177) internal successors, (2087), 1316 states have internal predecessors, (2087), 241 states have call successors, (241), 93 states have call predecessors, (241), 91 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:31:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2624 transitions. [2025-03-16 18:31:58,527 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2624 transitions. Word has length 156 [2025-03-16 18:31:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:58,527 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2624 transitions. [2025-03-16 18:31:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2624 transitions. [2025-03-16 18:31:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 18:31:58,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:58,531 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 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] [2025-03-16 18:31:58,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 18:31:58,731 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,SelfDestructingSolverStorable24 [2025-03-16 18:31:58,732 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:58,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1971329102, now seen corresponding path program 1 times [2025-03-16 18:31:58,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:58,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604094761] [2025-03-16 18:31:58,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 18:31:58,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 18:31:58,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:58,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-16 18:31:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604094761] [2025-03-16 18:31:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604094761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133415692] [2025-03-16 18:31:58,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:58,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:58,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:58,918 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:31:58,920 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:31:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 18:31:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 18:31:59,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:59,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:59,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:31:59,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 18:31:59,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133415692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:59,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-16 18:31:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45625594] [2025-03-16 18:31:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:59,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:59,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:59,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:31:59,161 INFO L87 Difference]: Start difference. First operand 1622 states and 2624 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:31:59,304 INFO L93 Difference]: Finished difference Result 3305 states and 5389 transitions. [2025-03-16 18:31:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:31:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-16 18:31:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:31:59,312 INFO L225 Difference]: With dead ends: 3305 [2025-03-16 18:31:59,312 INFO L226 Difference]: Without dead ends: 1724 [2025-03-16 18:31:59,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:31:59,318 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 140 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:31:59,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2365 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:31:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2025-03-16 18:31:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1700. [2025-03-16 18:31:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1365 states have (on average 1.6358974358974359) internal successors, (2233), 1392 states have internal predecessors, (2233), 241 states have call successors, (241), 95 states have call predecessors, (241), 93 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:31:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2770 transitions. [2025-03-16 18:31:59,364 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2770 transitions. Word has length 160 [2025-03-16 18:31:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:31:59,365 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2770 transitions. [2025-03-16 18:31:59,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:31:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2770 transitions. [2025-03-16 18:31:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 18:31:59,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:31:59,369 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 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] [2025-03-16 18:31:59,377 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:31:59,570 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,SelfDestructingSolverStorable25 [2025-03-16 18:31:59,571 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:31:59,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:31:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1905071690, now seen corresponding path program 1 times [2025-03-16 18:31:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:31:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044997844] [2025-03-16 18:31:59,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:31:59,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 18:31:59,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 18:31:59,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:59,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 18:31:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:31:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044997844] [2025-03-16 18:31:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044997844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:31:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168506880] [2025-03-16 18:31:59,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:31:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:31:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:31:59,742 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:31:59,743 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:31:59,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 18:31:59,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 18:31:59,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:31:59,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:31:59,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:31:59,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:31:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-16 18:31:59,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:31:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168506880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:31:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:31:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-16 18:31:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660049249] [2025-03-16 18:31:59,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:31:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:31:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:31:59,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:31:59,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:31:59,982 INFO L87 Difference]: Start difference. First operand 1700 states and 2770 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:32:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:00,138 INFO L93 Difference]: Finished difference Result 3467 states and 5683 transitions. [2025-03-16 18:32:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:32:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-16 18:32:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:00,146 INFO L225 Difference]: With dead ends: 3467 [2025-03-16 18:32:00,146 INFO L226 Difference]: Without dead ends: 1808 [2025-03-16 18:32:00,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:32:00,152 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 138 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:00,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2362 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:32:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2025-03-16 18:32:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1778. [2025-03-16 18:32:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1441 states have (on average 1.6509368494101317) internal successors, (2379), 1468 states have internal predecessors, (2379), 241 states have call successors, (241), 97 states have call predecessors, (241), 95 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:32:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2916 transitions. [2025-03-16 18:32:00,196 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2916 transitions. Word has length 163 [2025-03-16 18:32:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2916 transitions. [2025-03-16 18:32:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:32:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2916 transitions. [2025-03-16 18:32:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 18:32:00,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:00,200 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 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] [2025-03-16 18:32:00,208 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:32:00,400 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,SelfDestructingSolverStorable26 [2025-03-16 18:32:00,401 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash -401704652, now seen corresponding path program 1 times [2025-03-16 18:32:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375865124] [2025-03-16 18:32:00,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:00,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 18:32:00,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 18:32:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 18:32:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375865124] [2025-03-16 18:32:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375865124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:32:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424052255] [2025-03-16 18:32:00,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:32:00,567 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:32:00,569 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:32:00,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 18:32:00,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 18:32:00,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:00,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:00,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:32:00,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:32:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 18:32:00,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:32:00,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424052255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:32:00,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:32:00,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-16 18:32:00,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189832863] [2025-03-16 18:32:00,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:32:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:32:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:00,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:32:00,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-16 18:32:00,817 INFO L87 Difference]: Start difference. First operand 1778 states and 2916 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:32:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:00,977 INFO L93 Difference]: Finished difference Result 3629 states and 5977 transitions. [2025-03-16 18:32:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:32:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-16 18:32:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:00,991 INFO L225 Difference]: With dead ends: 3629 [2025-03-16 18:32:00,991 INFO L226 Difference]: Without dead ends: 1892 [2025-03-16 18:32:00,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:32:00,997 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 136 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:00,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2355 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:32:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-03-16 18:32:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1856. [2025-03-16 18:32:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1517 states have (on average 1.6644693473961767) internal successors, (2525), 1544 states have internal predecessors, (2525), 241 states have call successors, (241), 99 states have call predecessors, (241), 97 states have return successors, (296), 236 states have call predecessors, (296), 237 states have call successors, (296) [2025-03-16 18:32:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 3062 transitions. [2025-03-16 18:32:01,047 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 3062 transitions. Word has length 165 [2025-03-16 18:32:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:01,048 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 3062 transitions. [2025-03-16 18:32:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 18:32:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 3062 transitions. [2025-03-16 18:32:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 18:32:01,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:01,051 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 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] [2025-03-16 18:32:01,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 18:32:01,252 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,SelfDestructingSolverStorable27 [2025-03-16 18:32:01,252 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:01,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:01,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1617001304, now seen corresponding path program 1 times [2025-03-16 18:32:01,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747711399] [2025-03-16 18:32:01,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:01,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 18:32:01,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 18:32:01,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:01,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-16 18:32:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747711399] [2025-03-16 18:32:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747711399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:32:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448440919] [2025-03-16 18:32:01,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:01,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:32:01,409 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:32:01,411 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:32:01,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 18:32:01,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 18:32:01,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:01,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:01,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 18:32:01,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:32:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 18:32:01,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:32:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448440919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:32:01,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:32:01,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-16 18:32:01,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259661529] [2025-03-16 18:32:01,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:32:01,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:32:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:01,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:32:01,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:32:01,810 INFO L87 Difference]: Start difference. First operand 1856 states and 3062 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:32:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:03,883 INFO L93 Difference]: Finished difference Result 5771 states and 9667 transitions. [2025-03-16 18:32:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:32:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 165 [2025-03-16 18:32:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:03,902 INFO L225 Difference]: With dead ends: 5771 [2025-03-16 18:32:03,902 INFO L226 Difference]: Without dead ends: 3588 [2025-03-16 18:32:03,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:32:03,912 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1936 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 4156 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 4614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 4156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:03,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 2363 Invalid, 4614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 4156 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 18:32:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2025-03-16 18:32:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3576. [2025-03-16 18:32:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 2879 states have (on average 1.6658562000694686) internal successors, (4796), 2959 states have internal predecessors, (4796), 499 states have call successors, (499), 179 states have call predecessors, (499), 197 states have return successors, (641), 495 states have call predecessors, (641), 495 states have call successors, (641) [2025-03-16 18:32:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5936 transitions. [2025-03-16 18:32:04,044 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5936 transitions. Word has length 165 [2025-03-16 18:32:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:04,044 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5936 transitions. [2025-03-16 18:32:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 18:32:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5936 transitions. [2025-03-16 18:32:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 18:32:04,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:04,051 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 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] [2025-03-16 18:32:04,059 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:32:04,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:04,252 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:04,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1006720879, now seen corresponding path program 1 times [2025-03-16 18:32:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:04,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354194544] [2025-03-16 18:32:04,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:04,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:04,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 18:32:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 18:32:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 18:32:04,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354194544] [2025-03-16 18:32:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354194544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:32:04,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:32:04,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:32:04,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857396010] [2025-03-16 18:32:04,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:32:04,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:32:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:04,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:32:04,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:32:04,357 INFO L87 Difference]: Start difference. First operand 3576 states and 5936 transitions. Second operand has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:32:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:04,484 INFO L93 Difference]: Finished difference Result 6982 states and 11617 transitions. [2025-03-16 18:32:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:32:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 168 [2025-03-16 18:32:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:04,499 INFO L225 Difference]: With dead ends: 6982 [2025-03-16 18:32:04,500 INFO L226 Difference]: Without dead ends: 3309 [2025-03-16 18:32:04,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:32:04,509 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 29 mSDsluCounter, 4981 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5816 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:04,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5816 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:32:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-03-16 18:32:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3297. [2025-03-16 18:32:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 2700 states have (on average 1.6855555555555555) internal successors, (4551), 2767 states have internal predecessors, (4551), 419 states have call successors, (419), 167 states have call predecessors, (419), 177 states have return successors, (511), 410 states have call predecessors, (511), 415 states have call successors, (511) [2025-03-16 18:32:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 5481 transitions. [2025-03-16 18:32:04,584 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 5481 transitions. Word has length 168 [2025-03-16 18:32:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:04,584 INFO L471 AbstractCegarLoop]: Abstraction has 3297 states and 5481 transitions. [2025-03-16 18:32:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:32:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 5481 transitions. [2025-03-16 18:32:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-16 18:32:04,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:04,596 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 18:32:04,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 18:32:04,597 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 809229747, now seen corresponding path program 1 times [2025-03-16 18:32:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135074724] [2025-03-16 18:32:04,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:04,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-16 18:32:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-16 18:32:04,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:04,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 65 proven. 91 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-03-16 18:32:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135074724] [2025-03-16 18:32:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135074724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:32:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022867948] [2025-03-16 18:32:05,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:32:05,046 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:32:05,047 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:32:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-16 18:32:05,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-16 18:32:05,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:05,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:05,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 3301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 18:32:05,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:32:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 644 proven. 17 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2025-03-16 18:32:05,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:32:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 86 proven. 64 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2025-03-16 18:32:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022867948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:32:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:32:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 28 [2025-03-16 18:32:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981893621] [2025-03-16 18:32:06,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:32:06,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 18:32:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 18:32:06,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-16 18:32:06,589 INFO L87 Difference]: Start difference. First operand 3297 states and 5481 transitions. Second operand has 28 states, 26 states have (on average 17.692307692307693) internal successors, (460), 24 states have internal predecessors, (460), 19 states have call successors, (110), 9 states have call predecessors, (110), 15 states have return successors, (111), 21 states have call predecessors, (111), 19 states have call successors, (111) [2025-03-16 18:32:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:44,135 INFO L93 Difference]: Finished difference Result 49273 states and 87507 transitions. [2025-03-16 18:32:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 430 states. [2025-03-16 18:32:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 17.692307692307693) internal successors, (460), 24 states have internal predecessors, (460), 19 states have call successors, (110), 9 states have call predecessors, (110), 15 states have return successors, (111), 21 states have call predecessors, (111), 19 states have call successors, (111) Word has length 495 [2025-03-16 18:32:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:44,447 INFO L225 Difference]: With dead ends: 49273 [2025-03-16 18:32:44,448 INFO L226 Difference]: Without dead ends: 45912 [2025-03-16 18:32:44,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1549 GetRequests, 1101 SyntacticMatches, 3 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92996 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=16349, Invalid=183013, Unknown=0, NotChecked=0, Total=199362 [2025-03-16 18:32:44,546 INFO L435 NwaCegarLoop]: 2207 mSDtfsCounter, 44642 mSDsluCounter, 21962 mSDsCounter, 0 mSdLazyCounter, 78540 mSolverCounterSat, 16714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44656 SdHoareTripleChecker+Valid, 24169 SdHoareTripleChecker+Invalid, 95254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 16714 IncrementalHoareTripleChecker+Valid, 78540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:44,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44656 Valid, 24169 Invalid, 95254 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [16714 Valid, 78540 Invalid, 0 Unknown, 0 Unchecked, 27.9s Time] [2025-03-16 18:32:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45912 states. [2025-03-16 18:32:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45912 to 38150. [2025-03-16 18:32:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38150 states, 31261 states have (on average 1.6667732957998784) internal successors, (52105), 32089 states have internal predecessors, (52105), 4554 states have call successors, (4554), 1988 states have call predecessors, (4554), 2334 states have return successors, (7157), 4648 states have call predecessors, (7157), 4536 states have call successors, (7157) [2025-03-16 18:32:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 63816 transitions. [2025-03-16 18:32:46,914 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 63816 transitions. Word has length 495 [2025-03-16 18:32:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 38150 states and 63816 transitions. [2025-03-16 18:32:46,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 17.692307692307693) internal successors, (460), 24 states have internal predecessors, (460), 19 states have call successors, (110), 9 states have call predecessors, (110), 15 states have return successors, (111), 21 states have call predecessors, (111), 19 states have call successors, (111) [2025-03-16 18:32:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 63816 transitions. [2025-03-16 18:32:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2025-03-16 18:32:47,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:47,052 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 15, 12, 12, 12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 18:32:47,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-16 18:32:47,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:47,255 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash -303187034, now seen corresponding path program 1 times [2025-03-16 18:32:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902850120] [2025-03-16 18:32:47,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:47,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-03-16 18:32:47,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-03-16 18:32:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 90 proven. 99 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2025-03-16 18:32:48,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:48,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902850120] [2025-03-16 18:32:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902850120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:32:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866726360] [2025-03-16 18:32:48,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:32:48,366 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:32:48,368 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:32:48,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 549 statements into 1 equivalence classes. [2025-03-16 18:32:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 549 of 549 statements. [2025-03-16 18:32:48,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:48,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:48,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 3464 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:32:48,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:32:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 861 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-16 18:32:48,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:32:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866726360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:32:48,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:32:48,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-03-16 18:32:48,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65501583] [2025-03-16 18:32:48,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:32:48,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:32:48,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:48,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:32:48,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:32:48,977 INFO L87 Difference]: Start difference. First operand 38150 states and 63816 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 6 states have internal predecessors, (226), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-16 18:32:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:32:50,404 INFO L93 Difference]: Finished difference Result 76762 states and 129006 transitions. [2025-03-16 18:32:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:32:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 6 states have internal predecessors, (226), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) Word has length 549 [2025-03-16 18:32:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:32:50,591 INFO L225 Difference]: With dead ends: 76762 [2025-03-16 18:32:50,591 INFO L226 Difference]: Without dead ends: 38690 [2025-03-16 18:32:50,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:32:50,720 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 0 mSDsluCounter, 4251 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5105 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:32:50,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5105 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:32:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38690 states. [2025-03-16 18:32:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38690 to 38564. [2025-03-16 18:32:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38564 states, 31585 states have (on average 1.659933512743391) internal successors, (52429), 32455 states have internal predecessors, (52429), 4554 states have call successors, (4554), 1988 states have call predecessors, (4554), 2424 states have return successors, (7334), 4696 states have call predecessors, (7334), 4536 states have call successors, (7334) [2025-03-16 18:32:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38564 states to 38564 states and 64317 transitions. [2025-03-16 18:32:52,382 INFO L78 Accepts]: Start accepts. Automaton has 38564 states and 64317 transitions. Word has length 549 [2025-03-16 18:32:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:32:52,384 INFO L471 AbstractCegarLoop]: Abstraction has 38564 states and 64317 transitions. [2025-03-16 18:32:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 6 states have internal predecessors, (226), 2 states have call successors, (42), 2 states have call predecessors, (42), 3 states have return successors, (41), 3 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-16 18:32:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38564 states and 64317 transitions. [2025-03-16 18:32:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-16 18:32:52,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:32:52,512 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 15, 12, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:52,524 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:32:52,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:52,714 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:32:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:32:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1197838534, now seen corresponding path program 1 times [2025-03-16 18:32:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:32:52,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622109450] [2025-03-16 18:32:52,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:32:52,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 18:32:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 18:32:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 90 proven. 89 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2025-03-16 18:32:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:32:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622109450] [2025-03-16 18:32:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622109450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:32:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010850288] [2025-03-16 18:32:53,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:32:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:32:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:32:53,320 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:32:53,322 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:32:53,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 18:32:53,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 18:32:53,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:32:53,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:32:53,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 3477 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 18:32:53,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:32:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 1079 proven. 7 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-16 18:32:54,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:32:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 109 proven. 63 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2025-03-16 18:32:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010850288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:32:55,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:32:55,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 29 [2025-03-16 18:32:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172216478] [2025-03-16 18:32:55,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:32:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 18:32:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:32:55,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 18:32:55,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-03-16 18:32:55,290 INFO L87 Difference]: Start difference. First operand 38564 states and 64317 transitions. Second operand has 29 states, 26 states have (on average 19.807692307692307) internal successors, (515), 25 states have internal predecessors, (515), 17 states have call successors, (127), 8 states have call predecessors, (127), 18 states have return successors, (129), 18 states have call predecessors, (129), 17 states have call successors, (129)