./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9cfe95aaca007f6467395901a9efc89e5ad27f0fc32ae7ae8a1fe4e27a1f35c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:03:11,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:03:11,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:03:11,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:03:11,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:03:11,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:03:11,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:03:11,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:03:11,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:03:11,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:03:11,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:03:11,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:03:11,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:03:11,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:03:11,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:03:11,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:11,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:03:11,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:11,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:03:11,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:03:11,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:03:11,229 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-jdk21/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 -> 9cfe95aaca007f6467395901a9efc89e5ad27f0fc32ae7ae8a1fe4e27a1f35c1 [2025-01-09 04:03:11,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:03:11,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:03:11,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:03:11,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:03:11,448 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:03:11,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c [2025-01-09 04:03:12,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4260aeab9/61bf758ffe5043d9abc72fa5282a6f48/FLAGe6e55cab6 [2025-01-09 04:03:12,834 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:03:12,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c [2025-01-09 04:03:12,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4260aeab9/61bf758ffe5043d9abc72fa5282a6f48/FLAGe6e55cab6 [2025-01-09 04:03:12,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4260aeab9/61bf758ffe5043d9abc72fa5282a6f48 [2025-01-09 04:03:12,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:03:12,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:03:12,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:12,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:03:12,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:03:12,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:12" (1/1) ... [2025-01-09 04:03:12,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37553018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:12, skipping insertion in model container [2025-01-09 04:03:12,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:12" (1/1) ... [2025-01-09 04:03:12,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:03:12,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c[1605,1618] [2025-01-09 04:03:13,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:13,109 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:03:13,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-01-09 04:03:13,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2025-01-09 04:03:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [279] [2025-01-09 04:03:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [349] [2025-01-09 04:03:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [453] [2025-01-09 04:03:13,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [819] [2025-01-09 04:03:13,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [868] [2025-01-09 04:03:13,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [906] [2025-01-09 04:03:13,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product50.cil.c[1605,1618] [2025-01-09 04:03:13,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:03:13,186 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:03:13,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13 WrapperNode [2025-01-09 04:03:13,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:03:13,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:13,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:03:13,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:03:13,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,213 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 209 [2025-01-09 04:03:13,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:03:13,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:03:13,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:03:13,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:03:13,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,233 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:03:13,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,239 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:03:13,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:03:13,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:03:13,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:03:13,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (1/1) ... [2025-01-09 04:03:13,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:03:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:13,269 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:03:13,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:03:13,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:03:13,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:03:13,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:03:13,353 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:03:13,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:03:13,591 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 04:03:13,592 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:03:13,600 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:03:13,600 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:03:13,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:13 BoogieIcfgContainer [2025-01-09 04:03:13,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:03:13,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:03:13,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:03:13,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:03:13,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:12" (1/3) ... [2025-01-09 04:03:13,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7823e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:13, skipping insertion in model container [2025-01-09 04:03:13,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:13" (2/3) ... [2025-01-09 04:03:13,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7823e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:13, skipping insertion in model container [2025-01-09 04:03:13,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:13" (3/3) ... [2025-01-09 04:03:13,607 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product50.cil.c [2025-01-09 04:03:13,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:03:13,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product50.cil.c that has 8 procedures, 91 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:03:13,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:03:13,662 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;@15ea0a44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:03:13,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:03:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 78 states have internal predecessors, (95), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 04:03:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 04:03:13,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:13,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:13,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:13,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -268521172, now seen corresponding path program 1 times [2025-01-09 04:03:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543144743] [2025-01-09 04:03:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:13,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 04:03:13,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 04:03:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:13,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:13,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543144743] [2025-01-09 04:03:13,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543144743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:13,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:13,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311108848] [2025-01-09 04:03:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:13,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:13,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:13,894 INFO L87 Difference]: Start difference. First operand has 91 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 78 states have internal predecessors, (95), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:13,924 INFO L93 Difference]: Finished difference Result 161 states and 213 transitions. [2025-01-09 04:03:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 04:03:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:13,932 INFO L225 Difference]: With dead ends: 161 [2025-01-09 04:03:13,932 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 04:03:13,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:13,936 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:13,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 180 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 04:03:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 04:03:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:03:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2025-01-09 04:03:13,963 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 32 [2025-01-09 04:03:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:13,964 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2025-01-09 04:03:13,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:03:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2025-01-09 04:03:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:03:13,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:13,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:13,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:03:13,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1451865304, now seen corresponding path program 1 times [2025-01-09 04:03:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:13,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-01-09 04:03:13,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:13,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:03:13,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:03:13,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:13,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-01-09 04:03:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571889627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-01-09 04:03:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:14,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:14,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:14,142 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:14,223 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2025-01-09 04:03:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-01-09 04:03:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:14,225 INFO L225 Difference]: With dead ends: 140 [2025-01-09 04:03:14,225 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 04:03:14,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:03:14,226 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:14,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 231 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 04:03:14,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 04:03:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:03:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2025-01-09 04:03:14,235 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 37 [2025-01-09 04:03:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2025-01-09 04:03:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2025-01-09 04:03:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:03:14,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:14,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:03:14,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash 789764516, now seen corresponding path program 1 times [2025-01-09 04:03:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:14,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-01-09 04:03:14,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:14,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:03:14,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:03:14,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-01-09 04:03:14,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360294191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:14,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:14,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:03:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998908667] [2025-01-09 04:03:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:14,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:03:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:14,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:03:14,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:14,301 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:14,338 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2025-01-09 04:03:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:03:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-01-09 04:03:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:14,341 INFO L225 Difference]: With dead ends: 187 [2025-01-09 04:03:14,341 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 04:03:14,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:03:14,343 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:14,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 174 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 04:03:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-01-09 04:03:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 99 states have internal predecessors, (119), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2025-01-09 04:03:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2025-01-09 04:03:14,357 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 45 [2025-01-09 04:03:14,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:14,357 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2025-01-09 04:03:14,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:03:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2025-01-09 04:03:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:03:14,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:14,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:14,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:03:14,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:14,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1309568383, now seen corresponding path program 1 times [2025-01-09 04:03:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557117003] [2025-01-09 04:03:14,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:14,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:03:14,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:03:14,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:14,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557117003] [2025-01-09 04:03:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557117003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:03:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478923450] [2025-01-09 04:03:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:14,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:03:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:14,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:03:14,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:03:14,479 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:14,597 INFO L93 Difference]: Finished difference Result 433 states and 581 transitions. [2025-01-09 04:03:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:03:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-01-09 04:03:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:14,600 INFO L225 Difference]: With dead ends: 433 [2025-01-09 04:03:14,600 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 04:03:14,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-01-09 04:03:14,602 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 127 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:14,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 319 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 04:03:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2025-01-09 04:03:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 241 states have (on average 1.2904564315352698) internal successors, (311), 256 states have internal predecessors, (311), 38 states have call successors, (38), 32 states have call predecessors, (38), 33 states have return successors, (63), 39 states have call predecessors, (63), 38 states have call successors, (63) [2025-01-09 04:03:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 412 transitions. [2025-01-09 04:03:14,642 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 412 transitions. Word has length 51 [2025-01-09 04:03:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:14,643 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 412 transitions. [2025-01-09 04:03:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 412 transitions. [2025-01-09 04:03:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:03:14,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:14,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:03:14,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:14,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash 886866557, now seen corresponding path program 1 times [2025-01-09 04:03:14,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:14,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-01-09 04:03:14,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:14,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:03:14,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:03:14,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:14,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:14,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421247339] [2025-01-09 04:03:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421247339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65577051] [2025-01-09 04:03:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:14,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:14,754 INFO L87 Difference]: Start difference. First operand 313 states and 412 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:14,789 INFO L93 Difference]: Finished difference Result 627 states and 845 transitions. [2025-01-09 04:03:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:14,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-01-09 04:03:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:14,792 INFO L225 Difference]: With dead ends: 627 [2025-01-09 04:03:14,794 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 04:03:14,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:14,796 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:14,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 04:03:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-01-09 04:03:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 250 states have (on average 1.28) internal successors, (320), 265 states have internal predecessors, (320), 38 states have call successors, (38), 32 states have call predecessors, (38), 33 states have return successors, (63), 39 states have call predecessors, (63), 38 states have call successors, (63) [2025-01-09 04:03:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 421 transitions. [2025-01-09 04:03:14,828 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 421 transitions. Word has length 51 [2025-01-09 04:03:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:14,829 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 421 transitions. [2025-01-09 04:03:14,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 421 transitions. [2025-01-09 04:03:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:03:14,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:14,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:03:14,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:14,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -802077185, now seen corresponding path program 1 times [2025-01-09 04:03:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-01-09 04:03:14,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:14,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:03:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:03:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010209581] [2025-01-09 04:03:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010209581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:03:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149098815] [2025-01-09 04:03:14,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:03:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:14,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:03:14,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:14,910 INFO L87 Difference]: Start difference. First operand 322 states and 421 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:14,946 INFO L93 Difference]: Finished difference Result 592 states and 796 transitions. [2025-01-09 04:03:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:03:14,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-01-09 04:03:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:14,950 INFO L225 Difference]: With dead ends: 592 [2025-01-09 04:03:14,950 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 04:03:14,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:03:14,951 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:14,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 04:03:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 04:03:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.2651162790697674) internal successors, (272), 228 states have internal predecessors, (272), 33 states have call successors, (33), 28 states have call predecessors, (33), 29 states have return successors, (51), 34 states have call predecessors, (51), 33 states have call successors, (51) [2025-01-09 04:03:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 356 transitions. [2025-01-09 04:03:14,972 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 356 transitions. Word has length 51 [2025-01-09 04:03:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:14,972 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 356 transitions. [2025-01-09 04:03:14,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:03:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 356 transitions. [2025-01-09 04:03:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:03:14,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:14,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:14,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:03:14,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:14,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash 154480345, now seen corresponding path program 1 times [2025-01-09 04:03:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:14,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-01-09 04:03:14,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:14,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:03:15,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:03:15,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:15,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:03:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-01-09 04:03:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353787288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:15,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:03:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017502421] [2025-01-09 04:03:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:03:15,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:15,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:03:15,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:03:15,073 INFO L87 Difference]: Start difference. First operand 278 states and 356 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:15,266 INFO L93 Difference]: Finished difference Result 580 states and 753 transitions. [2025-01-09 04:03:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2025-01-09 04:03:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:15,269 INFO L225 Difference]: With dead ends: 580 [2025-01-09 04:03:15,269 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 04:03:15,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:03:15,270 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 124 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:15,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 381 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:03:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 04:03:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2025-01-09 04:03:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 251 states have internal predecessors, (294), 36 states have call successors, (36), 28 states have call predecessors, (36), 33 states have return successors, (61), 38 states have call predecessors, (61), 36 states have call successors, (61) [2025-01-09 04:03:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 391 transitions. [2025-01-09 04:03:15,291 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 391 transitions. Word has length 53 [2025-01-09 04:03:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 391 transitions. [2025-01-09 04:03:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 391 transitions. [2025-01-09 04:03:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:03:15,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:15,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:15,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:03:15,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1471020581, now seen corresponding path program 1 times [2025-01-09 04:03:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961421627] [2025-01-09 04:03:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:15,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:03:15,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:03:15,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:15,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:03:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961421627] [2025-01-09 04:03:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961421627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:03:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215443854] [2025-01-09 04:03:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:03:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:15,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:03:15,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:03:15,464 INFO L87 Difference]: Start difference. First operand 308 states and 391 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:15,755 INFO L93 Difference]: Finished difference Result 876 states and 1160 transitions. [2025-01-09 04:03:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:03:15,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2025-01-09 04:03:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:15,759 INFO L225 Difference]: With dead ends: 876 [2025-01-09 04:03:15,759 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 04:03:15,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:03:15,761 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 267 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:15,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 570 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 04:03:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 554. [2025-01-09 04:03:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 424 states have (on average 1.221698113207547) internal successors, (518), 450 states have internal predecessors, (518), 67 states have call successors, (67), 50 states have call predecessors, (67), 62 states have return successors, (113), 71 states have call predecessors, (113), 67 states have call successors, (113) [2025-01-09 04:03:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 698 transitions. [2025-01-09 04:03:15,799 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 698 transitions. Word has length 55 [2025-01-09 04:03:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:15,799 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 698 transitions. [2025-01-09 04:03:15,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:03:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 698 transitions. [2025-01-09 04:03:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:03:15,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:15,801 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:03:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:03:15,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2104636450, now seen corresponding path program 1 times [2025-01-09 04:03:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-01-09 04:03:15,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:15,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:03:15,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:03:15,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:15,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:03:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-01-09 04:03:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409579384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968382473] [2025-01-09 04:03:15,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:15,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:15,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:15,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:15,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:03:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:03:16,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:03:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:16,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:03:16,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:03:16,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:03:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968382473] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:16,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2025-01-09 04:03:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700360574] [2025-01-09 04:03:16,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:03:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:16,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:03:16,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:03:16,384 INFO L87 Difference]: Start difference. First operand 554 states and 698 transitions. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 12 states have internal predecessors, (126), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2025-01-09 04:03:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:16,719 INFO L93 Difference]: Finished difference Result 1241 states and 1629 transitions. [2025-01-09 04:03:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:03:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 12 states have internal predecessors, (126), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) Word has length 96 [2025-01-09 04:03:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:16,724 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 04:03:16,724 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 04:03:16,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:03:16,729 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 207 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:16,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1536 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:03:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 04:03:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 641. [2025-01-09 04:03:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 484 states have (on average 1.2169421487603307) internal successors, (589), 519 states have internal predecessors, (589), 80 states have call successors, (80), 68 states have call predecessors, (80), 76 states have return successors, (116), 78 states have call predecessors, (116), 80 states have call successors, (116) [2025-01-09 04:03:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 785 transitions. [2025-01-09 04:03:16,782 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 785 transitions. Word has length 96 [2025-01-09 04:03:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:16,782 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 785 transitions. [2025-01-09 04:03:16,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 12 states have internal predecessors, (126), 5 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2025-01-09 04:03:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 785 transitions. [2025-01-09 04:03:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:03:16,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:16,785 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:16,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:03:16,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:16,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:16,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1704406198, now seen corresponding path program 1 times [2025-01-09 04:03:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:16,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515585098] [2025-01-09 04:03:16,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:17,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:03:17,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:03:17,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:17,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 04:03:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515585098] [2025-01-09 04:03:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515585098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:03:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:03:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:03:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790407827] [2025-01-09 04:03:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:03:17,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:03:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:17,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:03:17,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:17,112 INFO L87 Difference]: Start difference. First operand 641 states and 785 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:03:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:17,149 INFO L93 Difference]: Finished difference Result 1235 states and 1529 transitions. [2025-01-09 04:03:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:03:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 168 [2025-01-09 04:03:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:17,154 INFO L225 Difference]: With dead ends: 1235 [2025-01-09 04:03:17,154 INFO L226 Difference]: Without dead ends: 650 [2025-01-09 04:03:17,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:03:17,156 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:17,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:03:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-01-09 04:03:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2025-01-09 04:03:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 493 states have (on average 1.2129817444219066) internal successors, (598), 528 states have internal predecessors, (598), 80 states have call successors, (80), 68 states have call predecessors, (80), 76 states have return successors, (116), 78 states have call predecessors, (116), 80 states have call successors, (116) [2025-01-09 04:03:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 794 transitions. [2025-01-09 04:03:17,192 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 794 transitions. Word has length 168 [2025-01-09 04:03:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 794 transitions. [2025-01-09 04:03:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:03:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 794 transitions. [2025-01-09 04:03:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:03:17,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:17,198 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:03:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:03:17,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:17,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:17,199 INFO L85 PathProgramCache]: Analyzing trace with hash -317620788, now seen corresponding path program 1 times [2025-01-09 04:03:17,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:17,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-01-09 04:03:17,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:17,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:17,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:03:17,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:03:17,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:17,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 88 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 04:03:17,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-01-09 04:03:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410014047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:17,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111579627] [2025-01-09 04:03:17,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:17,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:17,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:17,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:17,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:03:17,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:03:17,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:03:17,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:17,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:03:17,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 136 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 04:03:17,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 77 proven. 40 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-09 04:03:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111579627] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:18,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2025-01-09 04:03:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638125215] [2025-01-09 04:03:18,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:03:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:03:18,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:03:18,072 INFO L87 Difference]: Start difference. First operand 650 states and 794 transitions. Second operand has 25 states, 25 states have (on average 8.48) internal successors, (212), 24 states have internal predecessors, (212), 11 states have call successors, (26), 6 states have call predecessors, (26), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2025-01-09 04:03:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:18,589 INFO L93 Difference]: Finished difference Result 1426 states and 1809 transitions. [2025-01-09 04:03:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:03:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.48) internal successors, (212), 24 states have internal predecessors, (212), 11 states have call successors, (26), 6 states have call predecessors, (26), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 168 [2025-01-09 04:03:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:18,595 INFO L225 Difference]: With dead ends: 1426 [2025-01-09 04:03:18,595 INFO L226 Difference]: Without dead ends: 784 [2025-01-09 04:03:18,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:03:18,597 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 520 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:18,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 810 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:03:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-09 04:03:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 711. [2025-01-09 04:03:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.188539741219963) internal successors, (643), 573 states have internal predecessors, (643), 91 states have call successors, (91), 79 states have call predecessors, (91), 78 states have return successors, (114), 81 states have call predecessors, (114), 91 states have call successors, (114) [2025-01-09 04:03:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 848 transitions. [2025-01-09 04:03:18,658 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 848 transitions. Word has length 168 [2025-01-09 04:03:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 848 transitions. [2025-01-09 04:03:18,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.48) internal successors, (212), 24 states have internal predecessors, (212), 11 states have call successors, (26), 6 states have call predecessors, (26), 10 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2025-01-09 04:03:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 848 transitions. [2025-01-09 04:03:18,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 04:03:18,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:18,661 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:18,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:03:18,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:18,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:18,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash 309961308, now seen corresponding path program 1 times [2025-01-09 04:03:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:18,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548853519] [2025-01-09 04:03:18,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:18,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:03:18,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:03:18,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:18,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 99 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 04:03:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548853519] [2025-01-09 04:03:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548853519] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427259571] [2025-01-09 04:03:19,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:19,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:19,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:19,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:03:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 04:03:19,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 04:03:19,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:19,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:19,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 04:03:19,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 04:03:19,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 99 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 04:03:19,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427259571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:19,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:19,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-01-09 04:03:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993052818] [2025-01-09 04:03:19,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:19,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:03:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:19,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:03:19,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:03:19,569 INFO L87 Difference]: Start difference. First operand 711 states and 848 transitions. Second operand has 22 states, 22 states have (on average 10.0) internal successors, (220), 19 states have internal predecessors, (220), 7 states have call successors, (30), 5 states have call predecessors, (30), 13 states have return successors, (32), 11 states have call predecessors, (32), 7 states have call successors, (32) [2025-01-09 04:03:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:20,012 INFO L93 Difference]: Finished difference Result 1399 states and 1691 transitions. [2025-01-09 04:03:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:03:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.0) internal successors, (220), 19 states have internal predecessors, (220), 7 states have call successors, (30), 5 states have call predecessors, (30), 13 states have return successors, (32), 11 states have call predecessors, (32), 7 states have call successors, (32) Word has length 184 [2025-01-09 04:03:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:20,017 INFO L225 Difference]: With dead ends: 1399 [2025-01-09 04:03:20,017 INFO L226 Difference]: Without dead ends: 744 [2025-01-09 04:03:20,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:03:20,020 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 289 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:20,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 976 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:03:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-01-09 04:03:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 726. [2025-01-09 04:03:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 551 states have (on average 1.177858439201452) internal successors, (649), 583 states have internal predecessors, (649), 91 states have call successors, (91), 84 states have call predecessors, (91), 83 states have return successors, (114), 81 states have call predecessors, (114), 91 states have call successors, (114) [2025-01-09 04:03:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 854 transitions. [2025-01-09 04:03:20,058 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 854 transitions. Word has length 184 [2025-01-09 04:03:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:20,058 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 854 transitions. [2025-01-09 04:03:20,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.0) internal successors, (220), 19 states have internal predecessors, (220), 7 states have call successors, (30), 5 states have call predecessors, (30), 13 states have return successors, (32), 11 states have call predecessors, (32), 7 states have call successors, (32) [2025-01-09 04:03:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 854 transitions. [2025-01-09 04:03:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 04:03:20,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:20,061 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 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, 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-01-09 04:03:20,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:03:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:20,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -155495171, now seen corresponding path program 1 times [2025-01-09 04:03:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-01-09 04:03:20,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:20,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 04:03:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 04:03:20,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:20,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 90 proven. 59 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 04:03:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-01-09 04:03:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433086003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426926153] [2025-01-09 04:03:20,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:20,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:20,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:20,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:20,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:03:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 04:03:20,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 04:03:20,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:20,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:20,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 04:03:20,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 122 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 04:03:20,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 95 proven. 46 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-01-09 04:03:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426926153] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:21,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 13] total 22 [2025-01-09 04:03:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700045625] [2025-01-09 04:03:21,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:03:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:03:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:03:21,351 INFO L87 Difference]: Start difference. First operand 726 states and 854 transitions. Second operand has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 14 states have call successors, (36), 8 states have call predecessors, (36), 14 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) [2025-01-09 04:03:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:21,894 INFO L93 Difference]: Finished difference Result 1402 states and 1677 transitions. [2025-01-09 04:03:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 04:03:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 14 states have call successors, (36), 8 states have call predecessors, (36), 14 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) Word has length 185 [2025-01-09 04:03:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:21,899 INFO L225 Difference]: With dead ends: 1402 [2025-01-09 04:03:21,899 INFO L226 Difference]: Without dead ends: 962 [2025-01-09 04:03:21,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 365 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=404, Invalid=1002, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 04:03:21,901 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 552 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:21,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 814 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:03:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-01-09 04:03:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 892. [2025-01-09 04:03:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 678 states have (on average 1.176991150442478) internal successors, (798), 715 states have internal predecessors, (798), 112 states have call successors, (112), 103 states have call predecessors, (112), 101 states have return successors, (137), 101 states have call predecessors, (137), 112 states have call successors, (137) [2025-01-09 04:03:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1047 transitions. [2025-01-09 04:03:21,942 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1047 transitions. Word has length 185 [2025-01-09 04:03:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:21,942 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1047 transitions. [2025-01-09 04:03:21,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.727272727272727) internal successors, (236), 21 states have internal predecessors, (236), 14 states have call successors, (36), 8 states have call predecessors, (36), 14 states have return successors, (35), 14 states have call predecessors, (35), 14 states have call successors, (35) [2025-01-09 04:03:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1047 transitions. [2025-01-09 04:03:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 04:03:21,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:03:21,945 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-01-09 04:03:21,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:03:22,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 04:03:22,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:03:22,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:03:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -946585199, now seen corresponding path program 1 times [2025-01-09 04:03:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:03:22,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-01-09 04:03:22,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:03:22,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 04:03:22,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 04:03:22,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:22,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 148 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-09 04:03:22,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:03:22,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703464207] [2025-01-09 04:03:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703464207] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:03:22,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113508635] [2025-01-09 04:03:22,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:03:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:03:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:03:22,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:03:22,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:03:22,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 04:03:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 04:03:22,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:03:22,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:03:22,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 04:03:22,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:03:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 138 proven. 89 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-09 04:03:22,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:03:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 91 proven. 138 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 04:03:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113508635] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:03:23,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:03:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 16] total 27 [2025-01-09 04:03:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764856435] [2025-01-09 04:03:23,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:03:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:03:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:03:23,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:03:23,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:03:23,525 INFO L87 Difference]: Start difference. First operand 892 states and 1047 transitions. Second operand has 27 states, 27 states have (on average 10.814814814814815) internal successors, (292), 26 states have internal predecessors, (292), 15 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (48), 15 states have call predecessors, (48), 15 states have call successors, (48) [2025-01-09 04:03:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:03:24,455 INFO L93 Difference]: Finished difference Result 1509 states and 1797 transitions. [2025-01-09 04:03:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 04:03:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.814814814814815) internal successors, (292), 26 states have internal predecessors, (292), 15 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (48), 15 states have call predecessors, (48), 15 states have call successors, (48) Word has length 235 [2025-01-09 04:03:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:03:24,457 INFO L225 Difference]: With dead ends: 1509 [2025-01-09 04:03:24,457 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:03:24,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 458 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=787, Invalid=2519, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 04:03:24,461 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 660 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:03:24,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1457 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:03:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:03:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:03:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:03:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:03:24,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 235 [2025-01-09 04:03:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:03:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:03:24,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.814814814814815) internal successors, (292), 26 states have internal predecessors, (292), 15 states have call successors, (46), 8 states have call predecessors, (46), 16 states have return successors, (48), 15 states have call predecessors, (48), 15 states have call successors, (48) [2025-01-09 04:03:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:03:24,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:03:24,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:03:24,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:03:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 04:03:24,685 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:03:24,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:03:28,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:03:28,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:28 BoogieIcfgContainer [2025-01-09 04:03:28,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:03:28,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:03:28,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:03:28,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:03:28,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:13" (3/4) ... [2025-01-09 04:03:28,872 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:03:28,876 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-01-09 04:03:28,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 04:03:28,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:03:28,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:03:28,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:28,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:03:28,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:03:28,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:03:28,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:03:28,951 INFO L158 Benchmark]: Toolchain (without parser) took 16094.80ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 105.0MB in the beginning and 256.2MB in the end (delta: -151.2MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.71ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 86.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.27ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: RCFGBuilder took 355.85ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 65.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:03:28,952 INFO L158 Benchmark]: TraceAbstraction took 15266.54ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 64.5MB in the beginning and 264.5MB in the end (delta: -200.0MB). Peak memory consumption was 239.6MB. Max. memory is 16.1GB. [2025-01-09 04:03:28,953 INFO L158 Benchmark]: Witness Printer took 81.26ms. Allocated memory is still 469.8MB. Free memory was 264.5MB in the beginning and 256.2MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:03:28,954 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.71ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 86.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.27ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 355.85ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 65.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15266.54ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 64.5MB in the beginning and 264.5MB in the end (delta: -200.0MB). Peak memory consumption was 239.6MB. Max. memory is 16.1GB. * Witness Printer took 81.26ms. Allocated memory is still 469.8MB. Free memory was 264.5MB in the beginning and 256.2MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] - GenericResultAtLocation [Line: 279]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [279] - GenericResultAtLocation [Line: 349]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [349] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [453] - GenericResultAtLocation [Line: 819]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [819] - GenericResultAtLocation [Line: 868]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [868] - GenericResultAtLocation [Line: 906]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [906] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2960 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2923 mSDsluCounter, 8605 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6926 mSDsCounter, 833 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4340 IncrementalHoareTripleChecker+Invalid, 5173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 833 mSolverCounterUnsat, 1679 mSDtfsCounter, 4340 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1722 SyntacticMatches, 25 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=892occurred in iteration=13, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 348 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2279 NumberOfCodeBlocks, 2279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3123 ConstructedInterpolants, 0 QuantifiedInterpolants, 7511 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2613 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 2847/3498 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 918]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: (((((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (pumpRunning == 1))) || ((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 341]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:03:28,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE