./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 05:22:46,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:22:46,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:22:46,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:22:46,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:22:46,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:22:46,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:22:46,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:22:46,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:22:46,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:22:46,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:22:46,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:22:46,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:22:46,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:22:46,162 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:22:46,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:22:46,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:22:46,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:22:46,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:22:46,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:22:46,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:22:46,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:22:46,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:22:46,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:22:46,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:22:46,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:22:46,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:22:46,165 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-08 05:22:46,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:22:46,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:22:46,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:22:46,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:22:46,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:22:46,434 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-08 05:22:47,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431f17a25/7d0155195c3d4d15900557dd68196b14/FLAGe679e64c7 [2025-03-08 05:22:47,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:22:47,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product31.cil.c [2025-03-08 05:22:47,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431f17a25/7d0155195c3d4d15900557dd68196b14/FLAGe679e64c7 [2025-03-08 05:22:48,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/431f17a25/7d0155195c3d4d15900557dd68196b14 [2025-03-08 05:22:48,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:22:48,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:22:48,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:22:48,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:22:48,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:22:48,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8e7021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48, skipping insertion in model container [2025-03-08 05:22:48,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:22:48,545 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-08 05:22:48,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:22:48,559 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:22:48,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-03-08 05:22:48,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [716] [2025-03-08 05:22:48,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1082] [2025-03-08 05:22:48,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1183] [2025-03-08 05:22:48,567 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1221] [2025-03-08 05:22:48,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1341] [2025-03-08 05:22:48,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2956] [2025-03-08 05:22:48,568 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3305] [2025-03-08 05:22:48,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3342] [2025-03-08 05:22:48,569 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3351] [2025-03-08 05:22:48,649 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-08 05:22:48,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:22:48,674 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:22:48,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48 WrapperNode [2025-03-08 05:22:48,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:22:48,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:22:48,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:22:48,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:22:48,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,725 INFO L138 Inliner]: procedures = 94, calls = 342, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 894 [2025-03-08 05:22:48,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:22:48,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:22:48,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:22:48,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:22:48,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,767 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-08 05:22:48,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:22:48,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:22:48,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:22:48,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:22:48,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (1/1) ... [2025-03-08 05:22:48,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:22:48,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:48,837 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-08 05:22:48,839 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-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-08 05:22:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:22:48,855 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:22:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:22:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:22:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:22:48,857 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:22:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:22:48,857 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:22:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:22:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:22:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:22:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:22:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:22:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:22:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:22:48,997 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:22:48,999 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:22:49,057 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~23#1; [2025-03-08 05:22:49,057 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2315: #res#1 := ~retValue_acc~24#1; [2025-03-08 05:22:49,080 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338: #res := ~retValue_acc~10; [2025-03-08 05:22:49,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~8; [2025-03-08 05:22:49,105 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418: #res := ~retValue_acc~11; [2025-03-08 05:22:49,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: #res := ~retValue_acc~12; [2025-03-08 05:22:49,149 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2944: #res := ~retValue_acc~28; [2025-03-08 05:22:49,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2168-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~20#1; [2025-03-08 05:22:49,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: #res#1 := ~retValue_acc~21#1; [2025-03-08 05:22:49,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~22#1; [2025-03-08 05:22:49,342 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: #res := ~retValue_acc~26; [2025-03-08 05:22:49,352 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: #res := ~retValue_acc~9; [2025-03-08 05:22:49,471 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: #res := ~retValue_acc~19; [2025-03-08 05:22:49,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1634: #res := ~retValue_acc~14; [2025-03-08 05:22:49,522 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1683-1: isEmpty_#res#1 := isEmpty_~retValue_acc~16#1; [2025-03-08 05:22:49,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~17#1; [2025-03-08 05:22:49,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1776-1: isIdle_#res#1 := isIdle_~retValue_acc~18#1; [2025-03-08 05:22:49,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953-1: isExecutiveFloor_#res#1 := isExecutiveFloor_~retValue_acc~29#1; [2025-03-08 05:22:49,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~13#1; [2025-03-08 05:22:49,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-08 05:22:49,732 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-03-08 05:22:49,783 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1218-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-08 05:22:49,783 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302-1: main_#res#1 := main_~retValue_acc~31#1; [2025-03-08 05:22:49,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-03-08 05:22:49,794 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-03-08 05:22:49,897 INFO L? ?]: Removed 474 outVars from TransFormulas that were not future-live. [2025-03-08 05:22:49,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:22:49,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:22:49,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:22:49,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:49 BoogieIcfgContainer [2025-03-08 05:22:49,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:22:49,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:22:49,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:22:49,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:22:49,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:22:48" (1/3) ... [2025-03-08 05:22:49,920 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 08.03 05:22:49, skipping insertion in model container [2025-03-08 05:22:49,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:22:48" (2/3) ... [2025-03-08 05:22:49,920 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 08.03 05:22:49, skipping insertion in model container [2025-03-08 05:22:49,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:22:49" (3/3) ... [2025-03-08 05:22:49,921 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product31.cil.c [2025-03-08 05:22:49,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:22:49,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product31.cil.c that has 26 procedures, 566 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:22:49,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:22:49,984 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-08 05:22:49,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:22:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 440 states have (on average 1.6681818181818182) internal successors, (734), 456 states have internal predecessors, (734), 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-08 05:22:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:22:50,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:50,005 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-08 05:22:50,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:50,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -284492251, now seen corresponding path program 1 times [2025-03-08 05:22:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:50,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688381288] [2025-03-08 05:22:50,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:50,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:50,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:22:50,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:22:50,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:50,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:50,414 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-08 05:22:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688381288] [2025-03-08 05:22:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688381288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324206013] [2025-03-08 05:22:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:50,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:50,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:50,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:50,444 INFO L87 Difference]: Start difference. First operand has 566 states, 440 states have (on average 1.6681818181818182) internal successors, (734), 456 states have internal predecessors, (734), 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 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-08 05:22:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:50,610 INFO L93 Difference]: Finished difference Result 1125 states and 1864 transitions. [2025-03-08 05:22:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:50,612 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-08 05:22:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:50,625 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 05:22:50,625 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:22:50,632 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-08 05:22:50,634 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 6 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2742 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-08 05:22:50,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2742 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:22:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:22:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 436 states have (on average 1.6605504587155964) internal successors, (724), 451 states have internal predecessors, (724), 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-08 05:22:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 921 transitions. [2025-03-08 05:22:50,716 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 921 transitions. Word has length 103 [2025-03-08 05:22:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:50,717 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 921 transitions. [2025-03-08 05:22:50,718 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-08 05:22:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 921 transitions. [2025-03-08 05:22:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:22:50,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:50,726 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-08 05:22:50,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:22:50,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:50,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -704285939, now seen corresponding path program 1 times [2025-03-08 05:22:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728036971] [2025-03-08 05:22:50,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:50,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:22:50,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:22:50,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:50,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:50,956 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-08 05:22:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728036971] [2025-03-08 05:22:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728036971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:50,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941739592] [2025-03-08 05:22:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:50,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:50,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:50,959 INFO L87 Difference]: Start difference. First operand 561 states and 921 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-08 05:22:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:51,052 INFO L93 Difference]: Finished difference Result 1105 states and 1819 transitions. [2025-03-08 05:22:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:51,053 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-08 05:22:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:51,057 INFO L225 Difference]: With dead ends: 1105 [2025-03-08 05:22:51,057 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:22:51,060 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-08 05:22:51,061 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 4 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2714 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-08 05:22:51,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2714 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:22:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:22:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 436 states have (on average 1.658256880733945) internal successors, (723), 451 states have internal predecessors, (723), 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-08 05:22:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 920 transitions. [2025-03-08 05:22:51,104 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 920 transitions. Word has length 104 [2025-03-08 05:22:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:51,104 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 920 transitions. [2025-03-08 05:22:51,105 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-08 05:22:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 920 transitions. [2025-03-08 05:22:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:22:51,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:51,110 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-08 05:22:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:22:51,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:51,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 36270466, now seen corresponding path program 1 times [2025-03-08 05:22:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782046740] [2025-03-08 05:22:51,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:51,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:22:51,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:22:51,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,259 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-08 05:22:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782046740] [2025-03-08 05:22:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782046740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:51,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120008002] [2025-03-08 05:22:51,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:51,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:51,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:51,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:51,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:51,263 INFO L87 Difference]: Start difference. First operand 561 states and 920 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-08 05:22:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:51,318 INFO L93 Difference]: Finished difference Result 1105 states and 1818 transitions. [2025-03-08 05:22:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:51,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 105 [2025-03-08 05:22:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:51,322 INFO L225 Difference]: With dead ends: 1105 [2025-03-08 05:22:51,322 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:22:51,325 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-08 05:22:51,326 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 3 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2714 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-08 05:22:51,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2714 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:22:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:22:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 436 states have (on average 1.6559633027522935) internal successors, (722), 451 states have internal predecessors, (722), 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-08 05:22:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2025-03-08 05:22:51,357 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 105 [2025-03-08 05:22:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:51,358 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2025-03-08 05:22:51,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-08 05:22:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2025-03-08 05:22:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:22:51,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:51,365 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-08 05:22:51,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:22:51,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:51,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1907025910, now seen corresponding path program 1 times [2025-03-08 05:22:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314729396] [2025-03-08 05:22:51,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:51,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:22:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:22:51,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,510 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-08 05:22:51,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314729396] [2025-03-08 05:22:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314729396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882193404] [2025-03-08 05:22:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:51,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:51,515 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-08 05:22:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:51,563 INFO L93 Difference]: Finished difference Result 1105 states and 1817 transitions. [2025-03-08 05:22:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 106 [2025-03-08 05:22:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:51,567 INFO L225 Difference]: With dead ends: 1105 [2025-03-08 05:22:51,567 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:22:51,571 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-08 05:22:51,572 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 2 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2714 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-08 05:22:51,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2714 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:22:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:22:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 436 states have (on average 1.6536697247706422) internal successors, (721), 451 states have internal predecessors, (721), 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-08 05:22:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 918 transitions. [2025-03-08 05:22:51,596 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 918 transitions. Word has length 106 [2025-03-08 05:22:51,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:51,597 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 918 transitions. [2025-03-08 05:22:51,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-08 05:22:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 918 transitions. [2025-03-08 05:22:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:22:51,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:51,600 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-08 05:22:51,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:22:51,600 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:51,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1150412577, now seen corresponding path program 1 times [2025-03-08 05:22:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:51,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616736152] [2025-03-08 05:22:51,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:51,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:22:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:22:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,717 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-08 05:22:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616736152] [2025-03-08 05:22:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616736152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294106972] [2025-03-08 05:22:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:51,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:51,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:51,720 INFO L87 Difference]: Start difference. First operand 561 states and 918 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:51,763 INFO L93 Difference]: Finished difference Result 1105 states and 1816 transitions. [2025-03-08 05:22:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:22:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-08 05:22:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:51,766 INFO L225 Difference]: With dead ends: 1105 [2025-03-08 05:22:51,768 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 05:22:51,770 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-08 05:22:51,771 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 1 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2714 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-08 05:22:51,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2714 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 05:22:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-03-08 05:22:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 436 states have (on average 1.651376146788991) internal successors, (720), 451 states have internal predecessors, (720), 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-08 05:22:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 917 transitions. [2025-03-08 05:22:51,793 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 917 transitions. Word has length 107 [2025-03-08 05:22:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 917 transitions. [2025-03-08 05:22:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:22:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 917 transitions. [2025-03-08 05:22:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:22:51,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:51,796 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-08 05:22:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:22:51,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1699023111, now seen corresponding path program 1 times [2025-03-08 05:22:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880219585] [2025-03-08 05:22:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:51,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:22:51,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:22:51,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:51,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:51,990 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-08 05:22:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880219585] [2025-03-08 05:22:51,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880219585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:51,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:51,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:22:51,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201145284] [2025-03-08 05:22:51,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:51,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:22:51,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:51,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:22:51,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:51,992 INFO L87 Difference]: Start difference. First operand 561 states and 917 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-08 05:22:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:52,135 INFO L93 Difference]: Finished difference Result 1116 states and 1833 transitions. [2025-03-08 05:22:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:22:52,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 108 [2025-03-08 05:22:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:52,139 INFO L225 Difference]: With dead ends: 1116 [2025-03-08 05:22:52,139 INFO L226 Difference]: Without dead ends: 576 [2025-03-08 05:22:52,141 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-08 05:22:52,141 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 91 mSDsluCounter, 6227 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7129 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-08 05:22:52,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7129 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-08 05:22:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2025-03-08 05:22:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 446 states have (on average 1.647982062780269) internal successors, (735), 463 states have internal predecessors, (735), 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-08 05:22:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 937 transitions. [2025-03-08 05:22:52,160 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 937 transitions. Word has length 108 [2025-03-08 05:22:52,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:52,160 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 937 transitions. [2025-03-08 05:22:52,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-08 05:22:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 937 transitions. [2025-03-08 05:22:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:22:52,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:52,163 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-08 05:22:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:22:52,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:52,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1684772966, now seen corresponding path program 1 times [2025-03-08 05:22:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418505464] [2025-03-08 05:22:52,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:52,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:22:52,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:22:52,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:52,235 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-08 05:22:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418505464] [2025-03-08 05:22:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418505464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:22:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785827770] [2025-03-08 05:22:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:22:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:52,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:22:52,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:22:52,236 INFO L87 Difference]: Start difference. First operand 574 states and 937 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 05:22:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:52,281 INFO L93 Difference]: Finished difference Result 1123 states and 1844 transitions. [2025-03-08 05:22:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:22:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 108 [2025-03-08 05:22:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:52,285 INFO L225 Difference]: With dead ends: 1123 [2025-03-08 05:22:52,285 INFO L226 Difference]: Without dead ends: 570 [2025-03-08 05:22:52,287 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-08 05:22:52,288 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 1 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2709 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-08 05:22:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2709 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-08 05:22:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2025-03-08 05:22:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 444 states have (on average 1.6486486486486487) internal successors, (732), 460 states have internal predecessors, (732), 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-08 05:22:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 930 transitions. [2025-03-08 05:22:52,315 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 930 transitions. Word has length 108 [2025-03-08 05:22:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:52,315 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 930 transitions. [2025-03-08 05:22:52,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-08 05:22:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 930 transitions. [2025-03-08 05:22:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:22:52,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:52,318 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-08 05:22:52,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:22:52,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 309799286, now seen corresponding path program 1 times [2025-03-08 05:22:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823887431] [2025-03-08 05:22:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:52,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:22:52,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:22:52,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:52,441 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-08 05:22:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:52,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823887431] [2025-03-08 05:22:52,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823887431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:52,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:52,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:52,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547359659] [2025-03-08 05:22:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:52,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:52,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:52,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:52,443 INFO L87 Difference]: Start difference. First operand 570 states and 930 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-08 05:22:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:52,656 INFO L93 Difference]: Finished difference Result 1166 states and 1916 transitions. [2025-03-08 05:22:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:22:52,657 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-08 05:22:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:52,660 INFO L225 Difference]: With dead ends: 1166 [2025-03-08 05:22:52,660 INFO L226 Difference]: Without dead ends: 602 [2025-03-08 05:22:52,662 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-08 05:22:52,663 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 72 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4316 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-08 05:22:52,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4316 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:22:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-08 05:22:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 575. [2025-03-08 05:22:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6347438752783965) internal successors, (734), 464 states have internal predecessors, (734), 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-08 05:22:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 931 transitions. [2025-03-08 05:22:52,679 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 931 transitions. Word has length 109 [2025-03-08 05:22:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:52,679 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 931 transitions. [2025-03-08 05:22:52,680 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-08 05:22:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 931 transitions. [2025-03-08 05:22:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:22:52,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:52,682 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-08 05:22:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:22:52,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1598628606, now seen corresponding path program 1 times [2025-03-08 05:22:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136345200] [2025-03-08 05:22:52,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:52,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:22:52,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:22:52,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:52,792 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-08 05:22:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:52,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136345200] [2025-03-08 05:22:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136345200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127358412] [2025-03-08 05:22:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:52,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:52,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:52,794 INFO L87 Difference]: Start difference. First operand 575 states and 931 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-08 05:22:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:52,947 INFO L93 Difference]: Finished difference Result 1117 states and 1811 transitions. [2025-03-08 05:22:52,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 110 [2025-03-08 05:22:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:52,950 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:22:52,950 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:22:52,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:22:52,953 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 56 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4293 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-08 05:22:52,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4293 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:22:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 575. [2025-03-08 05:22:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6258351893095768) internal successors, (730), 464 states have internal predecessors, (730), 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-08 05:22:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 927 transitions. [2025-03-08 05:22:52,968 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 927 transitions. Word has length 110 [2025-03-08 05:22:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:52,968 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 927 transitions. [2025-03-08 05:22:52,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-08 05:22:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 927 transitions. [2025-03-08 05:22:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:22:52,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:52,971 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-08 05:22:52,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:22:52,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:52,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash -648002887, now seen corresponding path program 1 times [2025-03-08 05:22:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209394602] [2025-03-08 05:22:52,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:52,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:52,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:22:52,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:22:52,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:52,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,061 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-08 05:22:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209394602] [2025-03-08 05:22:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209394602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557018271] [2025-03-08 05:22:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:53,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:53,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:53,063 INFO L87 Difference]: Start difference. First operand 575 states and 927 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 05:22:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:53,203 INFO L93 Difference]: Finished difference Result 1117 states and 1807 transitions. [2025-03-08 05:22:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:53,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 111 [2025-03-08 05:22:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:53,207 INFO L225 Difference]: With dead ends: 1117 [2025-03-08 05:22:53,207 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 05:22:53,209 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-08 05:22:53,209 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 55 mSDsluCounter, 3421 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4288 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-08 05:22:53,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4288 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 05:22:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 575. [2025-03-08 05:22:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 449 states have (on average 1.6169265033407572) internal successors, (726), 464 states have internal predecessors, (726), 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-08 05:22:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 923 transitions. [2025-03-08 05:22:53,226 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 923 transitions. Word has length 111 [2025-03-08 05:22:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:53,226 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 923 transitions. [2025-03-08 05:22:53,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 05:22:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 923 transitions. [2025-03-08 05:22:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:22:53,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:53,229 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-08 05:22:53,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:22:53,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1226830952, now seen corresponding path program 1 times [2025-03-08 05:22:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523921089] [2025-03-08 05:22:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:53,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:22:53,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:22:53,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,329 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-08 05:22:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523921089] [2025-03-08 05:22:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523921089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:22:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33900807] [2025-03-08 05:22:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:22:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:22:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:22:53,330 INFO L87 Difference]: Start difference. First operand 575 states and 923 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 05:22:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:53,428 INFO L93 Difference]: Finished difference Result 1108 states and 1789 transitions. [2025-03-08 05:22:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:22:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 111 [2025-03-08 05:22:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:53,432 INFO L225 Difference]: With dead ends: 1108 [2025-03-08 05:22:53,432 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:22:53,435 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-08 05:22:53,435 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 94 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 5262 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-08 05:22:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 5262 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:22:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:22:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-08 05:22:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 428 states have (on average 1.6098130841121496) internal successors, (689), 443 states have internal predecessors, (689), 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-08 05:22:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 886 transitions. [2025-03-08 05:22:53,453 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 886 transitions. Word has length 111 [2025-03-08 05:22:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 886 transitions. [2025-03-08 05:22:53,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-08 05:22:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 886 transitions. [2025-03-08 05:22:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:22:53,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:53,456 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, 1] [2025-03-08 05:22:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:22:53,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:53,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash -824769887, now seen corresponding path program 1 times [2025-03-08 05:22:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137088941] [2025-03-08 05:22:53,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:22:53,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:22:53,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,577 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-08 05:22:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:53,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137088941] [2025-03-08 05:22:53,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137088941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:53,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:53,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:53,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278703215] [2025-03-08 05:22:53,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:53,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:53,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:53,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:53,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:53,579 INFO L87 Difference]: Start difference. First operand 554 states and 886 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-08 05:22:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:53,677 INFO L93 Difference]: Finished difference Result 1087 states and 1752 transitions. [2025-03-08 05:22:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:53,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 112 [2025-03-08 05:22:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:53,681 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 05:22:53,681 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:22:53,684 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-08 05:22:53,685 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 39 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4293 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-08 05:22:53,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4293 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:22:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-08 05:22:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 428 states have (on average 1.6074766355140186) internal successors, (688), 443 states have internal predecessors, (688), 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-08 05:22:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 885 transitions. [2025-03-08 05:22:53,706 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 885 transitions. Word has length 112 [2025-03-08 05:22:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 885 transitions. [2025-03-08 05:22:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-08 05:22:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 885 transitions. [2025-03-08 05:22:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:22:53,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:53,710 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, 1, 1] [2025-03-08 05:22:53,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:22:53,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1260247044, now seen corresponding path program 1 times [2025-03-08 05:22:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817148526] [2025-03-08 05:22:53,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:22:53,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:22:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:53,809 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-08 05:22:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817148526] [2025-03-08 05:22:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817148526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:53,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:22:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539093652] [2025-03-08 05:22:53,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:22:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:53,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:22:53,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:22:53,810 INFO L87 Difference]: Start difference. First operand 554 states and 885 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08 05:22:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:53,905 INFO L93 Difference]: Finished difference Result 1087 states and 1751 transitions. [2025-03-08 05:22:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:53,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 113 [2025-03-08 05:22:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:53,909 INFO L225 Difference]: With dead ends: 1087 [2025-03-08 05:22:53,909 INFO L226 Difference]: Without dead ends: 563 [2025-03-08 05:22:53,915 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-08 05:22:53,916 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 38 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4293 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-08 05:22:53,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4293 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-08 05:22:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 554. [2025-03-08 05:22:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 428 states have (on average 1.605140186915888) internal successors, (687), 443 states have internal predecessors, (687), 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-08 05:22:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 884 transitions. [2025-03-08 05:22:53,933 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 884 transitions. Word has length 113 [2025-03-08 05:22:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:53,933 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 884 transitions. [2025-03-08 05:22:53,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08 05:22:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 884 transitions. [2025-03-08 05:22:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:22:53,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:53,936 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, 1, 1, 1] [2025-03-08 05:22:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:22:53,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1125804476, now seen corresponding path program 1 times [2025-03-08 05:22:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240928281] [2025-03-08 05:22:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:53,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:22:53,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:22:53,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:53,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:54,125 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-08 05:22:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240928281] [2025-03-08 05:22:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240928281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:54,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:22:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:22:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510379135] [2025-03-08 05:22:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:54,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:22:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:54,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:22:54,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:22:54,127 INFO L87 Difference]: Start difference. First operand 554 states and 884 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-08 05:22:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:54,263 INFO L93 Difference]: Finished difference Result 1077 states and 1733 transitions. [2025-03-08 05:22:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:22:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 114 [2025-03-08 05:22:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:54,266 INFO L225 Difference]: With dead ends: 1077 [2025-03-08 05:22:54,266 INFO L226 Difference]: Without dead ends: 559 [2025-03-08 05:22:54,269 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-08 05:22:54,269 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 21 mSDsluCounter, 6689 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7529 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-08 05:22:54,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7529 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:22:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-08 05:22:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 556. [2025-03-08 05:22:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 430 states have (on average 1.6) internal successors, (688), 445 states have internal predecessors, (688), 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-08 05:22:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 885 transitions. [2025-03-08 05:22:54,287 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 885 transitions. Word has length 114 [2025-03-08 05:22:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:54,287 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 885 transitions. [2025-03-08 05:22:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-08 05:22:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 885 transitions. [2025-03-08 05:22:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:22:54,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:54,290 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, 1, 1, 1, 1] [2025-03-08 05:22:54,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:22:54,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:54,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1430843759, now seen corresponding path program 1 times [2025-03-08 05:22:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517772230] [2025-03-08 05:22:54,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:54,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:22:54,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:22:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:54,382 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-08 05:22:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517772230] [2025-03-08 05:22:54,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517772230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:54,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433768750] [2025-03-08 05:22:54,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:54,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:54,385 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-08 05:22:54,387 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-08 05:22:54,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:22:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:22:54,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:54,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:54,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:54,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:54,746 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-08 05:22:54,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433768750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:54,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202461628] [2025-03-08 05:22:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:54,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:54,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:54,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:54,751 INFO L87 Difference]: Start difference. First operand 556 states and 885 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-08 05:22:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:55,218 INFO L93 Difference]: Finished difference Result 1077 states and 1759 transitions. [2025-03-08 05:22:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:55,219 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 115 [2025-03-08 05:22:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:55,222 INFO L225 Difference]: With dead ends: 1077 [2025-03-08 05:22:55,222 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 05:22:55,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 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-08 05:22:55,225 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 823 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2150 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-08 05:22:55,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2150 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 05:22:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-08 05:22:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 437 states have (on average 1.6018306636155606) internal successors, (700), 452 states have internal predecessors, (700), 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-08 05:22:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 898 transitions. [2025-03-08 05:22:55,243 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 898 transitions. Word has length 115 [2025-03-08 05:22:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 898 transitions. [2025-03-08 05:22:55,243 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-08 05:22:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 898 transitions. [2025-03-08 05:22:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:22:55,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:55,246 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, 1, 1, 1, 1] [2025-03-08 05:22:55,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:22:55,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:22:55,447 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:55,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash 437233192, now seen corresponding path program 1 times [2025-03-08 05:22:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473924220] [2025-03-08 05:22:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:55,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:22:55,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:22:55,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:55,566 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-08 05:22:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473924220] [2025-03-08 05:22:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473924220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594152813] [2025-03-08 05:22:55,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:55,570 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-08 05:22:55,572 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-08 05:22:55,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:22:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:22:55,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:55,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:55,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:55,934 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-08 05:22:55,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:55,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594152813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118510580] [2025-03-08 05:22:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:55,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:55,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:55,935 INFO L87 Difference]: Start difference. First operand 564 states and 898 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-08 05:22:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:56,388 INFO L93 Difference]: Finished difference Result 1093 states and 1782 transitions. [2025-03-08 05:22:56,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:56,388 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 118 [2025-03-08 05:22:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:56,393 INFO L225 Difference]: With dead ends: 1093 [2025-03-08 05:22:56,394 INFO L226 Difference]: Without dead ends: 572 [2025-03-08 05:22:56,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 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-08 05:22:56,398 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 814 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2147 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-08 05:22:56,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2147 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-08 05:22:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-08 05:22:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6036036036036037) internal successors, (712), 459 states have internal predecessors, (712), 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-08 05:22:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 911 transitions. [2025-03-08 05:22:56,420 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 911 transitions. Word has length 118 [2025-03-08 05:22:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:56,421 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 911 transitions. [2025-03-08 05:22:56,421 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-08 05:22:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 911 transitions. [2025-03-08 05:22:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:22:56,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:56,424 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, 1, 1, 1, 1] [2025-03-08 05:22:56,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:22:56,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 05:22:56,628 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:56,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:56,629 INFO L85 PathProgramCache]: Analyzing trace with hash 21499724, now seen corresponding path program 1 times [2025-03-08 05:22:56,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:56,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980663391] [2025-03-08 05:22:56,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:56,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:56,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:22:56,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:22:56,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:56,719 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-08 05:22:56,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980663391] [2025-03-08 05:22:56,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980663391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325683650] [2025-03-08 05:22:56,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:56,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:56,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:56,722 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-08 05:22:56,723 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-08 05:22:56,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:22:56,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:22:56,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:56,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:56,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:56,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:57,009 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-08 05:22:57,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325683650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981894268] [2025-03-08 05:22:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:57,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:57,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:57,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:57,011 INFO L87 Difference]: Start difference. First operand 572 states and 911 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-08 05:22:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:57,450 INFO L93 Difference]: Finished difference Result 1109 states and 1805 transitions. [2025-03-08 05:22:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 121 [2025-03-08 05:22:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:57,454 INFO L225 Difference]: With dead ends: 1109 [2025-03-08 05:22:57,454 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 05:22:57,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 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-08 05:22:57,458 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 805 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 2144 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-08 05:22:57,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 2144 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 05:22:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-03-08 05:22:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 451 states have (on average 1.605321507760532) internal successors, (724), 466 states have internal predecessors, (724), 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-08 05:22:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 924 transitions. [2025-03-08 05:22:57,504 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 924 transitions. Word has length 121 [2025-03-08 05:22:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:57,504 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 924 transitions. [2025-03-08 05:22:57,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-08 05:22:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 924 transitions. [2025-03-08 05:22:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:22:57,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:57,507 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, 1, 1, 1, 1] [2025-03-08 05:22:57,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:57,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:57,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:57,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1195030337, now seen corresponding path program 1 times [2025-03-08 05:22:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120585173] [2025-03-08 05:22:57,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:57,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:22:57,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:22:57,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:57,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:57,802 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-08 05:22:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120585173] [2025-03-08 05:22:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120585173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629885848] [2025-03-08 05:22:57,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:57,805 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-08 05:22:57,816 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-08 05:22:57,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:22:58,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:22:58,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:58,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:58,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:22:58,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:58,176 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-08 05:22:58,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629885848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:58,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-08 05:22:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373027190] [2025-03-08 05:22:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:58,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:58,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:58,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:58,182 INFO L87 Difference]: Start difference. First operand 580 states and 924 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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-08 05:22:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:58,658 INFO L93 Difference]: Finished difference Result 1125 states and 1828 transitions. [2025-03-08 05:22:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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 124 [2025-03-08 05:22:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:58,664 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 05:22:58,664 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 05:22:58,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 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-08 05:22:58,667 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 812 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2141 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:58,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2141 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:22:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 05:22:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-03-08 05:22:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 458 states have (on average 1.6069868995633187) internal successors, (736), 473 states have internal predecessors, (736), 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-08 05:22:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 937 transitions. [2025-03-08 05:22:58,686 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 937 transitions. Word has length 124 [2025-03-08 05:22:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:58,686 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 937 transitions. [2025-03-08 05:22:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 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-08 05:22:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 937 transitions. [2025-03-08 05:22:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:22:58,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:58,688 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] [2025-03-08 05:22:58,698 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-08 05:22:58,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:22:58,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:58,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1509028957, now seen corresponding path program 1 times [2025-03-08 05:22:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835875495] [2025-03-08 05:22:58,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:58,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:58,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:22:58,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:22:58,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:58,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:22:58,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:22:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835875495] [2025-03-08 05:22:58,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835875495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:22:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084262457] [2025-03-08 05:22:58,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:58,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:22:58,967 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-08 05:22:58,969 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-08 05:22:59,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:22:59,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:22:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:22:59,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:22:59,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:22:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:22:59,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:22:59,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084262457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:22:59,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:22:59,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 05:22:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134318059] [2025-03-08 05:22:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:22:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:22:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:22:59,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:22:59,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:22:59,272 INFO L87 Difference]: Start difference. First operand 588 states and 937 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), 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-08 05:22:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:22:59,655 INFO L93 Difference]: Finished difference Result 1135 states and 1855 transitions. [2025-03-08 05:22:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:22:59,655 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), 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 127 [2025-03-08 05:22:59,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:22:59,659 INFO L225 Difference]: With dead ends: 1135 [2025-03-08 05:22:59,659 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 05:22:59,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:22:59,662 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 792 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:22:59,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2141 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:22:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 05:22:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-03-08 05:22:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 459 states have (on average 1.5969498910675382) internal successors, (733), 475 states have internal predecessors, (733), 99 states have call successors, (99), 31 states have call predecessors, (99), 31 states have return successors, (103), 96 states have call predecessors, (103), 98 states have call successors, (103) [2025-03-08 05:22:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 935 transitions. [2025-03-08 05:22:59,680 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 935 transitions. Word has length 127 [2025-03-08 05:22:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:22:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 935 transitions. [2025-03-08 05:22:59,681 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), 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-08 05:22:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 935 transitions. [2025-03-08 05:22:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:22:59,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:22:59,683 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] [2025-03-08 05:22:59,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:22:59,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:22:59,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:22:59,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:22:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -547872087, now seen corresponding path program 1 times [2025-03-08 05:22:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:22:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294801642] [2025-03-08 05:22:59,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:22:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:22:59,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:22:59,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:22:59,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:22:59,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:00,037 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-08 05:23:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294801642] [2025-03-08 05:23:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294801642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225448592] [2025-03-08 05:23:00,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:00,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:00,040 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-08 05:23:00,041 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-08 05:23:00,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:23:00,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:23:00,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:00,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:00,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:23:00,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:00,359 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-08 05:23:00,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225448592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:00,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 05:23:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079940440] [2025-03-08 05:23:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:00,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:23:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:00,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:23:00,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:23:00,360 INFO L87 Difference]: Start difference. First operand 590 states and 935 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 05:23:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:00,731 INFO L93 Difference]: Finished difference Result 1690 states and 2751 transitions. [2025-03-08 05:23:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:23:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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 127 [2025-03-08 05:23:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:00,737 INFO L225 Difference]: With dead ends: 1690 [2025-03-08 05:23:00,737 INFO L226 Difference]: Without dead ends: 1143 [2025-03-08 05:23:00,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 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-08 05:23:00,740 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 796 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 3320 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-08 05:23:00,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 3320 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:23:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-08 05:23:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1135. [2025-03-08 05:23:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 881 states have (on average 1.6106696935300795) internal successors, (1419), 914 states have internal predecessors, (1419), 192 states have call successors, (192), 59 states have call predecessors, (192), 61 states have return successors, (220), 187 states have call predecessors, (220), 190 states have call successors, (220) [2025-03-08 05:23:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1831 transitions. [2025-03-08 05:23:00,780 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1831 transitions. Word has length 127 [2025-03-08 05:23:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:00,780 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1831 transitions. [2025-03-08 05:23:00,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 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-08 05:23:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1831 transitions. [2025-03-08 05:23:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:23:00,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:00,783 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, 1, 1, 1, 1] [2025-03-08 05:23:00,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:00,984 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -420452444, now seen corresponding path program 1 times [2025-03-08 05:23:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104741353] [2025-03-08 05:23:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:00,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:01,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:01,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:01,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:01,158 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-08 05:23:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104741353] [2025-03-08 05:23:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104741353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229201444] [2025-03-08 05:23:01,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:01,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:01,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:01,160 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-08 05:23:01,162 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-08 05:23:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:01,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:01,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:01,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:01,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:23:01,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:01,381 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-08 05:23:01,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229201444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:23:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305957801] [2025-03-08 05:23:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:01,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:23:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:01,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:23:01,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:23:01,383 INFO L87 Difference]: Start difference. First operand 1135 states and 1831 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-08 05:23:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:01,470 INFO L93 Difference]: Finished difference Result 2765 states and 4528 transitions. [2025-03-08 05:23:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:23:01,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 132 [2025-03-08 05:23:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:01,477 INFO L225 Difference]: With dead ends: 2765 [2025-03-08 05:23:01,477 INFO L226 Difference]: Without dead ends: 1674 [2025-03-08 05:23:01,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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-08 05:23:01,481 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 825 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2521 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-08 05:23:01,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2521 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:23:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-03-08 05:23:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1135. [2025-03-08 05:23:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 881 states have (on average 1.6095346197502838) internal successors, (1418), 914 states have internal predecessors, (1418), 192 states have call successors, (192), 59 states have call predecessors, (192), 61 states have return successors, (220), 187 states have call predecessors, (220), 190 states have call successors, (220) [2025-03-08 05:23:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1830 transitions. [2025-03-08 05:23:01,535 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1830 transitions. Word has length 132 [2025-03-08 05:23:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:01,535 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1830 transitions. [2025-03-08 05:23:01,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-08 05:23:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1830 transitions. [2025-03-08 05:23:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:23:01,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:01,538 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, 1, 1, 1, 1] [2025-03-08 05:23:01,545 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-08 05:23:01,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:01,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:01,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -69652507, now seen corresponding path program 1 times [2025-03-08 05:23:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121002380] [2025-03-08 05:23:01,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:01,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:01,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:01,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:01,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:01,926 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-08 05:23:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121002380] [2025-03-08 05:23:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121002380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786903582] [2025-03-08 05:23:01,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:01,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:01,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:01,928 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-08 05:23:01,930 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-08 05:23:02,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:02,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:02,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:02,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:02,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:23:02,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:02,212 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-08 05:23:02,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:02,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786903582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:02,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:02,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 05:23:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355150060] [2025-03-08 05:23:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:02,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:23:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:02,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:23:02,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:23:02,214 INFO L87 Difference]: Start difference. First operand 1135 states and 1830 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-08 05:23:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:02,287 INFO L93 Difference]: Finished difference Result 2851 states and 4615 transitions. [2025-03-08 05:23:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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 132 [2025-03-08 05:23:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:02,297 INFO L225 Difference]: With dead ends: 2851 [2025-03-08 05:23:02,297 INFO L226 Difference]: Without dead ends: 1761 [2025-03-08 05:23:02,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 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-08 05:23:02,303 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 382 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 3720 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-08 05:23:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 3720 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:23:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-08 05:23:02,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2025-03-08 05:23:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1369 states have (on average 1.5814463111760408) internal successors, (2165), 1408 states have internal predecessors, (2165), 288 states have call successors, (288), 99 states have call predecessors, (288), 103 states have return successors, (369), 279 states have call predecessors, (369), 284 states have call successors, (369) [2025-03-08 05:23:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2822 transitions. [2025-03-08 05:23:02,393 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2822 transitions. Word has length 132 [2025-03-08 05:23:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2822 transitions. [2025-03-08 05:23:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-08 05:23:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2822 transitions. [2025-03-08 05:23:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:23:02,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:02,396 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, 1, 1, 1, 1] [2025-03-08 05:23:02,403 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-08 05:23:02,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 05:23:02,600 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -677729370, now seen corresponding path program 1 times [2025-03-08 05:23:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700634551] [2025-03-08 05:23:02,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:02,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:02,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:02,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:02,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:02,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:02,738 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-08 05:23:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700634551] [2025-03-08 05:23:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700634551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942286075] [2025-03-08 05:23:02,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:02,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:02,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:02,740 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-08 05:23:02,742 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-08 05:23:02,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:23:02,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:23:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:23:02,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:03,020 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-08 05:23:03,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942286075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-03-08 05:23:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669970576] [2025-03-08 05:23:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:23:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:23:03,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:23:03,023 INFO L87 Difference]: Start difference. First operand 1761 states and 2822 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-08 05:23:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:03,070 INFO L93 Difference]: Finished difference Result 3196 states and 5110 transitions. [2025-03-08 05:23:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:23:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 132 [2025-03-08 05:23:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:03,079 INFO L225 Difference]: With dead ends: 3196 [2025-03-08 05:23:03,079 INFO L226 Difference]: Without dead ends: 1480 [2025-03-08 05:23:03,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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-08 05:23:03,087 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 560 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1397 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-08 05:23:03,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1397 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:23:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-03-08 05:23:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-03-08 05:23:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1147 states have (on average 1.5605928509154317) internal successors, (1790), 1178 states have internal predecessors, (1790), 241 states have call successors, (241), 89 states have call predecessors, (241), 91 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2331 transitions. [2025-03-08 05:23:03,136 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2331 transitions. Word has length 132 [2025-03-08 05:23:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:03,136 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2331 transitions. [2025-03-08 05:23:03,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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-08 05:23:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2331 transitions. [2025-03-08 05:23:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 05:23:03,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:03,140 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, 1, 1, 1, 1] [2025-03-08 05:23:03,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:03,341 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1910769171, now seen corresponding path program 1 times [2025-03-08 05:23:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:03,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002241991] [2025-03-08 05:23:03,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:03,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:23:03,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:23:03,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:03,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:03,500 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-08 05:23:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002241991] [2025-03-08 05:23:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002241991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169445063] [2025-03-08 05:23:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:03,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:03,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:03,503 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-08 05:23:03,504 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-08 05:23:03,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:23:03,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:23:03,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:03,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:03,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:03,742 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-08 05:23:03,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169445063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:03,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516135254] [2025-03-08 05:23:03,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:03,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:03,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:03,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:03,745 INFO L87 Difference]: Start difference. First operand 1480 states and 2331 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-08 05:23:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:03,912 INFO L93 Difference]: Finished difference Result 3005 states and 4794 transitions. [2025-03-08 05:23:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:03,916 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 155 [2025-03-08 05:23:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:03,925 INFO L225 Difference]: With dead ends: 3005 [2025-03-08 05:23:03,925 INFO L226 Difference]: Without dead ends: 1570 [2025-03-08 05:23:03,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 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-08 05:23:03,931 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 144 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2389 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-08 05:23:03,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2389 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-08 05:23:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2025-03-08 05:23:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1223 states have (on average 1.5829926410466066) internal successors, (1936), 1254 states have internal predecessors, (1936), 241 states have call successors, (241), 91 states have call predecessors, (241), 93 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2477 transitions. [2025-03-08 05:23:03,986 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2477 transitions. Word has length 155 [2025-03-08 05:23:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2477 transitions. [2025-03-08 05:23:03,987 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-08 05:23:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2477 transitions. [2025-03-08 05:23:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:23:03,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:03,990 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, 1, 1, 1, 1] [2025-03-08 05:23:04,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:04,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 05:23:04,191 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1443744803, now seen corresponding path program 1 times [2025-03-08 05:23:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121198478] [2025-03-08 05:23:04,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:04,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:23:04,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:23:04,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:04,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:04,341 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-08 05:23:04,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121198478] [2025-03-08 05:23:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121198478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:04,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897330728] [2025-03-08 05:23:04,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:04,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:04,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:04,344 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-08 05:23:04,345 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-08 05:23:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:23:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:23:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:04,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:04,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:04,595 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-08 05:23:04,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897330728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:04,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605615768] [2025-03-08 05:23:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:04,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:04,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:04,596 INFO L87 Difference]: Start difference. First operand 1558 states and 2477 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-08 05:23:04,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:04,770 INFO L93 Difference]: Finished difference Result 3167 states and 5088 transitions. [2025-03-08 05:23:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:04,770 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-08 05:23:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:04,778 INFO L225 Difference]: With dead ends: 3167 [2025-03-08 05:23:04,778 INFO L226 Difference]: Without dead ends: 1654 [2025-03-08 05:23:04,783 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-08 05:23:04,784 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 142 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2386 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-08 05:23:04,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2386 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-08 05:23:04,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1636. [2025-03-08 05:23:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1299 states have (on average 1.6027713625866051) internal successors, (2082), 1330 states have internal predecessors, (2082), 241 states have call successors, (241), 93 states have call predecessors, (241), 95 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2623 transitions. [2025-03-08 05:23:04,831 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2623 transitions. Word has length 160 [2025-03-08 05:23:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2623 transitions. [2025-03-08 05:23:04,832 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-08 05:23:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2623 transitions. [2025-03-08 05:23:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:23:04,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:04,835 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, 1, 1, 1, 1] [2025-03-08 05:23:04,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:05,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 05:23:05,036 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1250022141, now seen corresponding path program 1 times [2025-03-08 05:23:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826587543] [2025-03-08 05:23:05,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:05,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:23:05,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:23:05,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:05,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:05,211 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-08 05:23:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826587543] [2025-03-08 05:23:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826587543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12906644] [2025-03-08 05:23:05,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:05,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:05,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:05,213 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-08 05:23:05,214 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-08 05:23:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:23:05,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:23:05,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:05,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:05,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:05,470 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-08 05:23:05,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12906644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356604274] [2025-03-08 05:23:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:05,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:05,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:05,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:05,472 INFO L87 Difference]: Start difference. First operand 1636 states and 2623 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-08 05:23:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:05,688 INFO L93 Difference]: Finished difference Result 3329 states and 5382 transitions. [2025-03-08 05:23:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:05,688 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 164 [2025-03-08 05:23:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:05,699 INFO L225 Difference]: With dead ends: 3329 [2025-03-08 05:23:05,699 INFO L226 Difference]: Without dead ends: 1738 [2025-03-08 05:23:05,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 168 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-08 05:23:05,706 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 140 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2383 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-08 05:23:05,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2383 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-03-08 05:23:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1714. [2025-03-08 05:23:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1375 states have (on average 1.6203636363636365) internal successors, (2228), 1406 states have internal predecessors, (2228), 241 states have call successors, (241), 95 states have call predecessors, (241), 97 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2769 transitions. [2025-03-08 05:23:05,759 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2769 transitions. Word has length 164 [2025-03-08 05:23:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:05,759 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2769 transitions. [2025-03-08 05:23:05,759 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-08 05:23:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2769 transitions. [2025-03-08 05:23:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:23:05,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:05,763 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, 1, 1, 1, 1] [2025-03-08 05:23:05,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:05,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 05:23:05,965 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1661628469, now seen corresponding path program 1 times [2025-03-08 05:23:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720777861] [2025-03-08 05:23:05,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:05,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:23:05,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:23:05,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:06,109 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-08 05:23:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720777861] [2025-03-08 05:23:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720777861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761846825] [2025-03-08 05:23:06,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:06,111 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-08 05:23:06,112 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-08 05:23:06,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:23:06,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:23:06,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:06,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:06,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:06,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:06,360 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-08 05:23:06,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:06,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761846825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:06,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:06,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:06,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415986037] [2025-03-08 05:23:06,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:06,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:06,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:06,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:06,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:06,361 INFO L87 Difference]: Start difference. First operand 1714 states and 2769 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-08 05:23:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:06,524 INFO L93 Difference]: Finished difference Result 3491 states and 5676 transitions. [2025-03-08 05:23:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 167 [2025-03-08 05:23:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:06,533 INFO L225 Difference]: With dead ends: 3491 [2025-03-08 05:23:06,533 INFO L226 Difference]: Without dead ends: 1822 [2025-03-08 05:23:06,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 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-08 05:23:06,538 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 138 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2380 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-08 05:23:06,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2380 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-03-08 05:23:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1792. [2025-03-08 05:23:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1451 states have (on average 1.6361130254996554) internal successors, (2374), 1482 states have internal predecessors, (2374), 241 states have call successors, (241), 97 states have call predecessors, (241), 99 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2915 transitions. [2025-03-08 05:23:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2915 transitions. Word has length 167 [2025-03-08 05:23:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:06,590 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2915 transitions. [2025-03-08 05:23:06,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-08 05:23:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2915 transitions. [2025-03-08 05:23:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:23:06,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:06,593 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, 1, 1, 1, 1] [2025-03-08 05:23:06,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 05:23:06,794 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -267788235, now seen corresponding path program 1 times [2025-03-08 05:23:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880124888] [2025-03-08 05:23:06,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:06,940 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-08 05:23:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880124888] [2025-03-08 05:23:06,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880124888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037541783] [2025-03-08 05:23:06,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:06,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:06,946 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-08 05:23:06,947 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-08 05:23:07,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:07,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:23:07,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:07,180 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-08 05:23:07,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037541783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 05:23:07,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587338580] [2025-03-08 05:23:07,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:23:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:07,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:23:07,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:23:07,181 INFO L87 Difference]: Start difference. First operand 1792 states and 2915 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-08 05:23:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:07,364 INFO L93 Difference]: Finished difference Result 3653 states and 5970 transitions. [2025-03-08 05:23:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:23:07,366 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 169 [2025-03-08 05:23:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:07,376 INFO L225 Difference]: With dead ends: 3653 [2025-03-08 05:23:07,377 INFO L226 Difference]: Without dead ends: 1906 [2025-03-08 05:23:07,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 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-08 05:23:07,383 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 136 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2373 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-08 05:23:07,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2373 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-03-08 05:23:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1870. [2025-03-08 05:23:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1527 states have (on average 1.650294695481336) internal successors, (2520), 1558 states have internal predecessors, (2520), 241 states have call successors, (241), 99 states have call predecessors, (241), 101 states have return successors, (300), 236 states have call predecessors, (300), 237 states have call successors, (300) [2025-03-08 05:23:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 3061 transitions. [2025-03-08 05:23:07,477 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 3061 transitions. Word has length 169 [2025-03-08 05:23:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 3061 transitions. [2025-03-08 05:23:07,477 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-08 05:23:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3061 transitions. [2025-03-08 05:23:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:23:07,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:07,481 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, 1] [2025-03-08 05:23:07,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 05:23:07,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:07,683 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1750917721, now seen corresponding path program 1 times [2025-03-08 05:23:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588841284] [2025-03-08 05:23:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:07,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:07,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:07,861 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-08 05:23:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588841284] [2025-03-08 05:23:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588841284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108872936] [2025-03-08 05:23:07,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:07,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:07,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:07,864 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-08 05:23:07,865 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-08 05:23:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:23:08,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:23:08,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:08,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:08,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 05:23:08,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:08,247 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-08 05:23:08,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108872936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-03-08 05:23:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751567885] [2025-03-08 05:23:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:23:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:08,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:23:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:23:08,253 INFO L87 Difference]: Start difference. First operand 1870 states and 3061 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 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-08 05:23:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:10,349 INFO L93 Difference]: Finished difference Result 5805 states and 9654 transitions. [2025-03-08 05:23:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:23:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 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 169 [2025-03-08 05:23:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:10,368 INFO L225 Difference]: With dead ends: 5805 [2025-03-08 05:23:10,368 INFO L226 Difference]: Without dead ends: 3612 [2025-03-08 05:23:10,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 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-08 05:23:10,377 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1943 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 4124 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 4588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 4124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:10,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 2342 Invalid, 4588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 4124 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:23:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2025-03-08 05:23:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3596. [2025-03-08 05:23:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2893 states have (on average 1.6546837193225026) internal successors, (4787), 2979 states have internal predecessors, (4787), 499 states have call successors, (499), 179 states have call predecessors, (499), 203 states have return successors, (647), 495 states have call predecessors, (647), 495 states have call successors, (647) [2025-03-08 05:23:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 5933 transitions. [2025-03-08 05:23:10,495 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 5933 transitions. Word has length 169 [2025-03-08 05:23:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 3596 states and 5933 transitions. [2025-03-08 05:23:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 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-08 05:23:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 5933 transitions. [2025-03-08 05:23:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 05:23:10,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:10,503 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, 1, 1, 1, 1] [2025-03-08 05:23:10,512 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-08 05:23:10,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 05:23:10,704 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 987930036, now seen corresponding path program 1 times [2025-03-08 05:23:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624528014] [2025-03-08 05:23:10,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 05:23:10,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 05:23:10,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:10,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:10,829 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-08 05:23:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624528014] [2025-03-08 05:23:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624528014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:23:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:23:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717695112] [2025-03-08 05:23:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:23:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:10,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:23:10,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:23:10,830 INFO L87 Difference]: Start difference. First operand 3596 states and 5933 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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-08 05:23:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:10,967 INFO L93 Difference]: Finished difference Result 7018 states and 11606 transitions. [2025-03-08 05:23:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:23:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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 172 [2025-03-08 05:23:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:10,984 INFO L225 Difference]: With dead ends: 7018 [2025-03-08 05:23:10,984 INFO L226 Difference]: Without dead ends: 3329 [2025-03-08 05:23:10,994 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-08 05:23:10,995 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 30 mSDsluCounter, 5016 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5857 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-08 05:23:10,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5857 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:23:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2025-03-08 05:23:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3317. [2025-03-08 05:23:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 2714 states have (on average 1.6735445836403833) internal successors, (4542), 2787 states have internal predecessors, (4542), 419 states have call successors, (419), 167 states have call predecessors, (419), 183 states have return successors, (517), 410 states have call predecessors, (517), 415 states have call successors, (517) [2025-03-08 05:23:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 5478 transitions. [2025-03-08 05:23:11,079 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 5478 transitions. Word has length 172 [2025-03-08 05:23:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:11,079 INFO L471 AbstractCegarLoop]: Abstraction has 3317 states and 5478 transitions. [2025-03-08 05:23:11,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 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-08 05:23:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 5478 transitions. [2025-03-08 05:23:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-08 05:23:11,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:11,091 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 6, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 05:23:11,091 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:11,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1699972901, now seen corresponding path program 1 times [2025-03-08 05:23:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029441805] [2025-03-08 05:23:11,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:11,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 05:23:11,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 05:23:11,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:11,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-03-08 05:23:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029441805] [2025-03-08 05:23:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029441805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791824086] [2025-03-08 05:23:11,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:11,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:11,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:11,639 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-08 05:23:11,641 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-08 05:23:11,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-08 05:23:12,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-08 05:23:12,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:12,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:12,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 3198 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:23:12,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 343 proven. 50 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2025-03-08 05:23:12,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:23:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 05:23:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791824086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:23:13,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:23:13,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 27 [2025-03-08 05:23:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171434673] [2025-03-08 05:23:13,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:23:13,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:23:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:13,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:23:13,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:23:13,100 INFO L87 Difference]: Start difference. First operand 3317 states and 5478 transitions. Second operand has 27 states, 25 states have (on average 14.84) internal successors, (371), 23 states have internal predecessors, (371), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-03-08 05:23:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:45,967 INFO L93 Difference]: Finished difference Result 36353 states and 61990 transitions. [2025-03-08 05:23:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2025-03-08 05:23:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 14.84) internal successors, (371), 23 states have internal predecessors, (371), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) Word has length 462 [2025-03-08 05:23:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:46,327 INFO L225 Difference]: With dead ends: 36353 [2025-03-08 05:23:46,327 INFO L226 Difference]: Without dead ends: 32718 [2025-03-08 05:23:46,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1009 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61310 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=10952, Invalid=125578, Unknown=0, NotChecked=0, Total=136530 [2025-03-08 05:23:46,426 INFO L435 NwaCegarLoop]: 2258 mSDtfsCounter, 38881 mSDsluCounter, 21736 mSDsCounter, 0 mSdLazyCounter, 75301 mSolverCounterSat, 13928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38881 SdHoareTripleChecker+Valid, 23994 SdHoareTripleChecker+Invalid, 89229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 13928 IncrementalHoareTripleChecker+Valid, 75301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:23:46,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38881 Valid, 23994 Invalid, 89229 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [13928 Valid, 75301 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2025-03-08 05:23:46,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2025-03-08 05:23:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 27620. [2025-03-08 05:23:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27620 states, 22691 states have (on average 1.649684897095765) internal successors, (37433), 23249 states have internal predecessors, (37433), 3301 states have call successors, (3301), 1501 states have call predecessors, (3301), 1627 states have return successors, (4649), 3289 states have call predecessors, (4649), 3283 states have call successors, (4649) [2025-03-08 05:23:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27620 states to 27620 states and 45383 transitions. [2025-03-08 05:23:47,995 INFO L78 Accepts]: Start accepts. Automaton has 27620 states and 45383 transitions. Word has length 462 [2025-03-08 05:23:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:47,997 INFO L471 AbstractCegarLoop]: Abstraction has 27620 states and 45383 transitions. [2025-03-08 05:23:47,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 14.84) internal successors, (371), 23 states have internal predecessors, (371), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-03-08 05:23:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27620 states and 45383 transitions. [2025-03-08 05:23:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-08 05:23:48,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:48,141 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1] [2025-03-08 05:23:48,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 05:23:48,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:48,347 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:48,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1474056807, now seen corresponding path program 1 times [2025-03-08 05:23:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428103801] [2025-03-08 05:23:48,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:48,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-08 05:23:48,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-08 05:23:48,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:48,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 61 proven. 72 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2025-03-08 05:23:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:49,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428103801] [2025-03-08 05:23:49,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428103801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:49,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661821138] [2025-03-08 05:23:49,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:49,470 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-08 05:23:49,472 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-08 05:23:49,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-08 05:23:50,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-08 05:23:50,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:50,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:50,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 3363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:23:50,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 671 proven. 0 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2025-03-08 05:23:50,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:23:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661821138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:23:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:23:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-03-08 05:23:50,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300728456] [2025-03-08 05:23:50,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:23:50,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:23:50,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:50,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:23:50,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:23:50,170 INFO L87 Difference]: Start difference. First operand 27620 states and 45383 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 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-08 05:23:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:23:51,225 INFO L93 Difference]: Finished difference Result 55464 states and 91289 transitions. [2025-03-08 05:23:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:23:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 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 516 [2025-03-08 05:23:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:23:51,333 INFO L225 Difference]: With dead ends: 55464 [2025-03-08 05:23:51,333 INFO L226 Difference]: Without dead ends: 27926 [2025-03-08 05:23:51,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 516 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-08 05:23:51,411 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 0 mSDsluCounter, 4281 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5141 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-08 05:23:51,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5141 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:23:51,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27926 states. [2025-03-08 05:23:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27926 to 27800. [2025-03-08 05:23:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27800 states, 22833 states have (on average 1.6456444619629484) internal successors, (37575), 23407 states have internal predecessors, (37575), 3301 states have call successors, (3301), 1501 states have call predecessors, (3301), 1665 states have return successors, (4694), 3311 states have call predecessors, (4694), 3283 states have call successors, (4694) [2025-03-08 05:23:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27800 states to 27800 states and 45570 transitions. [2025-03-08 05:23:52,586 INFO L78 Accepts]: Start accepts. Automaton has 27800 states and 45570 transitions. Word has length 516 [2025-03-08 05:23:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:23:52,588 INFO L471 AbstractCegarLoop]: Abstraction has 27800 states and 45570 transitions. [2025-03-08 05:23:52,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 6 states have internal predecessors, (233), 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-08 05:23:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27800 states and 45570 transitions. [2025-03-08 05:23:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-08 05:23:52,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:23:52,661 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:23:52,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 05:23:52,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:52,866 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:23:52,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:23:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1590305684, now seen corresponding path program 1 times [2025-03-08 05:23:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:23:52,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631315425] [2025-03-08 05:23:52,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:23:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-08 05:23:52,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-08 05:23:52,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:52,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 61 proven. 62 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2025-03-08 05:23:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:23:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631315425] [2025-03-08 05:23:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631315425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:23:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140862427] [2025-03-08 05:23:53,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:23:53,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:23:53,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:23:53,451 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:23:53,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:23:53,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-08 05:23:53,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-08 05:23:53,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:23:53,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:23:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 3356 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:23:53,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:23:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 542 proven. 32 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-03-08 05:23:54,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:23:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2025-03-08 05:23:55,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140862427] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:23:55,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:23:55,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 28 [2025-03-08 05:23:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485337256] [2025-03-08 05:23:55,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:23:55,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:23:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:23:55,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:23:55,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:23:55,207 INFO L87 Difference]: Start difference. First operand 27800 states and 45570 transitions. Second operand has 28 states, 25 states have (on average 16.88) internal successors, (422), 24 states have internal predecessors, (422), 15 states have call successors, (106), 7 states have call predecessors, (106), 17 states have return successors, (107), 17 states have call predecessors, (107), 15 states have call successors, (107)