./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ab30b3db91b0e47e6f9b2ed9ba465facc49148e5cdc1cad78e4808ba0c7de84 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:16:45,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:16:45,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:16:45,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:16:45,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:16:45,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:16:45,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:16:45,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:16:45,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:16:45,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:16:45,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:16:45,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:16:45,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:16:45,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:16:45,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:16:45,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:16:45,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:16:45,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:16:45,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:16:45,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:16:45,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:16:45,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:16:45,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:16:45,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:16:45,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:16:45,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:16:45,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:16:45,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:16:45,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:16:45,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:16:45,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:16:45,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:16:45,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:45,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:16:45,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:16:45,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:16:45,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:16:45,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:16:45,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:16:45,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:16:45,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:16:45,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:16:45,334 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ab30b3db91b0e47e6f9b2ed9ba465facc49148e5cdc1cad78e4808ba0c7de84 [2024-11-08 15:16:45,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:16:45,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:16:45,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:16:45,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:16:45,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:16:45,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c [2024-11-08 15:16:47,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:16:47,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:16:47,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c [2024-11-08 15:16:47,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ac099d3/7224ec9054e74ff985cf7d175895a734/FLAG4d8dc6edc [2024-11-08 15:16:47,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ac099d3/7224ec9054e74ff985cf7d175895a734 [2024-11-08 15:16:47,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:16:47,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:16:47,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:47,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:16:47,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:16:47,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9ad8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47, skipping insertion in model container [2024-11-08 15:16:47,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:16:47,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c[5071,5084] [2024-11-08 15:16:47,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:47,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:16:47,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-08 15:16:47,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [150] [2024-11-08 15:16:47,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [201] [2024-11-08 15:16:47,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [304] [2024-11-08 15:16:47,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [313] [2024-11-08 15:16:47,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [496] [2024-11-08 15:16:47,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [561] [2024-11-08 15:16:47,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [596] [2024-11-08 15:16:47,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product37.cil.c[5071,5084] [2024-11-08 15:16:47,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:47,973 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:16:47,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47 WrapperNode [2024-11-08 15:16:47,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:47,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:47,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:16:47,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:16:47,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,020 INFO L138 Inliner]: procedures = 55, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 203 [2024-11-08 15:16:48,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:48,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:16:48,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:16:48,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:16:48,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,059 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]. [2024-11-08 15:16:48,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:16:48,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:16:48,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:16:48,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:16:48,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:48,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:48,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:16:48,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:16:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:16:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:16:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:16:48,181 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:16:48,181 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:16:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:16:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:16:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:16:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:16:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:16:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:16:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-08 15:16:48,183 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-08 15:16:48,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:16:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:16:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:16:48,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:16:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:16:48,270 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:16:48,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:16:48,591 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-08 15:16:48,592 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:16:48,610 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:16:48,610 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:16:48,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48 BoogieIcfgContainer [2024-11-08 15:16:48,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:16:48,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:16:48,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:16:48,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:16:48,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:16:47" (1/3) ... [2024-11-08 15:16:48,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33fe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:48, skipping insertion in model container [2024-11-08 15:16:48,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (2/3) ... [2024-11-08 15:16:48,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33fe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:48, skipping insertion in model container [2024-11-08 15:16:48,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48" (3/3) ... [2024-11-08 15:16:48,621 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product37.cil.c [2024-11-08 15:16:48,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:16:48,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:16:48,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:16:48,720 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;@44eadc73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:16:48,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:16:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 77 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) [2024-11-08 15:16:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:16:48,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:48,738 INFO L215 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] [2024-11-08 15:16:48,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1723855951, now seen corresponding path program 1 times [2024-11-08 15:16:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165547366] [2024-11-08 15:16:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 15:16:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:16:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:48,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165547366] [2024-11-08 15:16:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165547366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:16:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315668576] [2024-11-08 15:16:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:16:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:16:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:16:49,042 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 77 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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) [2024-11-08 15:16:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,088 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2024-11-08 15:16:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:16:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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 [2024-11-08 15:16:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,100 INFO L225 Difference]: With dead ends: 171 [2024-11-08 15:16:49,101 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 15:16:49,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:16:49,111 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 15:16:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 15:16:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 69 states have internal predecessors, (81), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:16:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-08 15:16:49,163 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 32 [2024-11-08 15:16:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,164 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-08 15:16:49,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 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) [2024-11-08 15:16:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-08 15:16:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:16:49,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,171 INFO L215 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] [2024-11-08 15:16:49,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:16:49,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1860405445, now seen corresponding path program 1 times [2024-11-08 15:16:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735234403] [2024-11-08 15:16:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:16:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:16:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735234403] [2024-11-08 15:16:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735234403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470220921] [2024-11-08 15:16:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:49,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,333 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-08 15:16:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,361 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2024-11-08 15:16:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 33 [2024-11-08 15:16:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,363 INFO L225 Difference]: With dead ends: 127 [2024-11-08 15:16:49,364 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 15:16:49,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,367 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 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 [2024-11-08 15:16:49,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 15:16:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 15:16:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 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) [2024-11-08 15:16:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-08 15:16:49,386 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 33 [2024-11-08 15:16:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,386 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-08 15:16:49,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-08 15:16:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-08 15:16:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:16:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,388 INFO L215 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] [2024-11-08 15:16:49,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:16:49,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1706700211, now seen corresponding path program 1 times [2024-11-08 15:16:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273707286] [2024-11-08 15:16:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:16:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273707286] [2024-11-08 15:16:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273707286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494337102] [2024-11-08 15:16:49,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:49,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,556 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-08 15:16:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,581 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2024-11-08 15:16:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:49,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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 [2024-11-08 15:16:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,584 INFO L225 Difference]: With dead ends: 136 [2024-11-08 15:16:49,584 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 15:16:49,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,586 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 90 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 [2024-11-08 15:16:49,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 15:16:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 15:16:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 63 states have internal predecessors, (73), 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) [2024-11-08 15:16:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2024-11-08 15:16:49,603 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 37 [2024-11-08 15:16:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,604 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2024-11-08 15:16:49,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 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) [2024-11-08 15:16:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2024-11-08 15:16:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:16:49,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,608 INFO L215 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] [2024-11-08 15:16:49,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:16:49,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2032099452, now seen corresponding path program 1 times [2024-11-08 15:16:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242708522] [2024-11-08 15:16:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:16:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242708522] [2024-11-08 15:16:49,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242708522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595186764] [2024-11-08 15:16:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,685 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-08 15:16:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,727 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2024-11-08 15:16:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 43 [2024-11-08 15:16:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,733 INFO L225 Difference]: With dead ends: 183 [2024-11-08 15:16:49,733 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 15:16:49,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,735 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 74 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 168 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 [2024-11-08 15:16:49,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 15:16:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-11-08 15:16:49,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.288888888888889) internal successors, (116), 97 states have internal predecessors, (116), 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) [2024-11-08 15:16:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-08 15:16:49,766 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 43 [2024-11-08 15:16:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,768 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-08 15:16:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-08 15:16:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-08 15:16:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:16:49,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,773 INFO L215 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] [2024-11-08 15:16:49,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:16:49,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -870205615, now seen corresponding path program 1 times [2024-11-08 15:16:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590659157] [2024-11-08 15:16:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:16:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:16:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590659157] [2024-11-08 15:16:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590659157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:16:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554545802] [2024-11-08 15:16:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:16:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:16:49,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:16:49,953 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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) [2024-11-08 15:16:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:50,180 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2024-11-08 15:16:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:16:50,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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 [2024-11-08 15:16:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:50,183 INFO L225 Difference]: With dead ends: 255 [2024-11-08 15:16:50,183 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 15:16:50,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:50,185 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 51 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:50,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 364 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:16:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 15:16:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-08 15:16:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 119 states have internal predecessors, (144), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-08 15:16:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2024-11-08 15:16:50,202 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 51 [2024-11-08 15:16:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:50,203 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2024-11-08 15:16:50,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 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) [2024-11-08 15:16:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2024-11-08 15:16:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:16:50,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:50,205 INFO L215 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] [2024-11-08 15:16:50,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:16:50,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:50,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1735817939, now seen corresponding path program 1 times [2024-11-08 15:16:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:50,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41737468] [2024-11-08 15:16:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:16:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:16:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:50,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41737468] [2024-11-08 15:16:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41737468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:16:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522830840] [2024-11-08 15:16:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:50,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:16:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:50,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:16:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:16:50,375 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:16:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:50,550 INFO L93 Difference]: Finished difference Result 284 states and 370 transitions. [2024-11-08 15:16:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:16:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-11-08 15:16:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:50,553 INFO L225 Difference]: With dead ends: 284 [2024-11-08 15:16:50,553 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 15:16:50,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:50,558 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 111 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:50,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 279 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 15:16:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-08 15:16:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.280701754385965) internal successors, (146), 121 states have internal predecessors, (146), 16 states have call successors, (16), 12 states have call predecessors, (16), 15 states have return successors, (23), 17 states have call predecessors, (23), 16 states have call successors, (23) [2024-11-08 15:16:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2024-11-08 15:16:50,590 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 51 [2024-11-08 15:16:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:50,590 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2024-11-08 15:16:50,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:16:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2024-11-08 15:16:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:16:50,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:50,595 INFO L215 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] [2024-11-08 15:16:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:16:50,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2136447531, now seen corresponding path program 1 times [2024-11-08 15:16:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536965093] [2024-11-08 15:16:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:50,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:16:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:16:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:50,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536965093] [2024-11-08 15:16:50,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536965093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:50,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:50,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:16:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333260866] [2024-11-08 15:16:50,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:16:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:16:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:50,733 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:16:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:51,004 INFO L93 Difference]: Finished difference Result 421 states and 552 transitions. [2024-11-08 15:16:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:16:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 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 [2024-11-08 15:16:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:51,007 INFO L225 Difference]: With dead ends: 421 [2024-11-08 15:16:51,007 INFO L226 Difference]: Without dead ends: 283 [2024-11-08 15:16:51,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:16:51,011 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 210 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:51,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 290 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:16:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-08 15:16:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2024-11-08 15:16:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 222 states have internal predecessors, (265), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-08 15:16:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 352 transitions. [2024-11-08 15:16:51,063 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 352 transitions. Word has length 51 [2024-11-08 15:16:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:51,063 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 352 transitions. [2024-11-08 15:16:51,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:16:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 352 transitions. [2024-11-08 15:16:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:16:51,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:51,066 INFO L215 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] [2024-11-08 15:16:51,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:16:51,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:51,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1858186128, now seen corresponding path program 1 times [2024-11-08 15:16:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:51,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125416960] [2024-11-08 15:16:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:16:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:16:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 15:16:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:16:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125416960] [2024-11-08 15:16:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125416960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:16:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715473896] [2024-11-08 15:16:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:51,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:16:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:16:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:16:51,228 INFO L87 Difference]: Start difference. First operand 275 states and 352 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:51,508 INFO L93 Difference]: Finished difference Result 540 states and 699 transitions. [2024-11-08 15:16:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:16:51,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-08 15:16:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:51,512 INFO L225 Difference]: With dead ends: 540 [2024-11-08 15:16:51,512 INFO L226 Difference]: Without dead ends: 273 [2024-11-08 15:16:51,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:16:51,516 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 125 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 366 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:16:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-08 15:16:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2024-11-08 15:16:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 207 states have (on average 1.2222222222222223) internal successors, (253), 218 states have internal predecessors, (253), 34 states have call successors, (34), 28 states have call predecessors, (34), 29 states have return successors, (53), 34 states have call predecessors, (53), 34 states have call successors, (53) [2024-11-08 15:16:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 340 transitions. [2024-11-08 15:16:51,553 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 340 transitions. Word has length 53 [2024-11-08 15:16:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:51,553 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 340 transitions. [2024-11-08 15:16:51,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 340 transitions. [2024-11-08 15:16:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 15:16:51,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:51,555 INFO L215 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] [2024-11-08 15:16:51,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:16:51,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:51,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2030829189, now seen corresponding path program 1 times [2024-11-08 15:16:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345720805] [2024-11-08 15:16:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:16:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:16:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:16:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:51,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345720805] [2024-11-08 15:16:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345720805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:51,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:16:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337173296] [2024-11-08 15:16:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:51,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:16:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:51,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:16:51,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:51,797 INFO L87 Difference]: Start difference. First operand 271 states and 340 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:16:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:52,380 INFO L93 Difference]: Finished difference Result 813 states and 1064 transitions. [2024-11-08 15:16:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:16:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 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 [2024-11-08 15:16:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:52,385 INFO L225 Difference]: With dead ends: 813 [2024-11-08 15:16:52,385 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 15:16:52,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:16:52,388 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 390 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:52,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 513 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:16:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 15:16:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 524. [2024-11-08 15:16:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 425 states have internal predecessors, (489), 65 states have call successors, (65), 49 states have call predecessors, (65), 57 states have return successors, (104), 67 states have call predecessors, (104), 65 states have call successors, (104) [2024-11-08 15:16:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 658 transitions. [2024-11-08 15:16:52,448 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 658 transitions. Word has length 55 [2024-11-08 15:16:52,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:52,449 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 658 transitions. [2024-11-08 15:16:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:16:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 658 transitions. [2024-11-08 15:16:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 15:16:52,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:52,452 INFO L215 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] [2024-11-08 15:16:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:16:52,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 309041265, now seen corresponding path program 1 times [2024-11-08 15:16:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129361181] [2024-11-08 15:16:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:16:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:16:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:16:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:16:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:16:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:16:52,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129361181] [2024-11-08 15:16:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129361181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671008802] [2024-11-08 15:16:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:52,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:52,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:52,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:16:52,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:16:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:16:52,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:16:53,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 15:16:53,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671008802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:53,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-08 15:16:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191089750] [2024-11-08 15:16:53,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:16:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:16:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:16:53,287 INFO L87 Difference]: Start difference. First operand 524 states and 658 transitions. Second operand has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-08 15:16:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,437 INFO L93 Difference]: Finished difference Result 1125 states and 1452 transitions. [2024-11-08 15:16:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 15:16:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) Word has length 94 [2024-11-08 15:16:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,442 INFO L225 Difference]: With dead ends: 1125 [2024-11-08 15:16:54,442 INFO L226 Difference]: Without dead ends: 657 [2024-11-08 15:16:54,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=438, Invalid=1454, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:16:54,445 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 359 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1324 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 15:16:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-08 15:16:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 585. [2024-11-08 15:16:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 441 states have (on average 1.2086167800453516) internal successors, (533), 473 states have internal predecessors, (533), 75 states have call successors, (75), 63 states have call predecessors, (75), 68 states have return successors, (100), 70 states have call predecessors, (100), 75 states have call successors, (100) [2024-11-08 15:16:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 708 transitions. [2024-11-08 15:16:54,500 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 708 transitions. Word has length 94 [2024-11-08 15:16:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,500 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 708 transitions. [2024-11-08 15:16:54,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.6) internal successors, (129), 10 states have internal predecessors, (129), 6 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (17), 8 states have call predecessors, (17), 6 states have call successors, (17) [2024-11-08 15:16:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 708 transitions. [2024-11-08 15:16:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 15:16:54,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:54,505 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:16:54,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:16:54,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1424558119, now seen corresponding path program 1 times [2024-11-08 15:16:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303936140] [2024-11-08 15:16:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:16:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:16:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:16:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:16:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:16:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 15:16:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-08 15:16:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 15:16:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:16:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 97 proven. 7 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 15:16:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303936140] [2024-11-08 15:16:55,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303936140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:55,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349580980] [2024-11-08 15:16:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:55,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:55,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:16:55,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:16:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 15:16:55,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 15:16:55,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 78 proven. 42 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-08 15:16:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349580980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:55,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 28 [2024-11-08 15:16:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442381873] [2024-11-08 15:16:55,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:16:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:16:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:16:55,932 INFO L87 Difference]: Start difference. First operand 585 states and 708 transitions. Second operand has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-08 15:16:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:57,803 INFO L93 Difference]: Finished difference Result 1678 states and 2119 transitions. [2024-11-08 15:16:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 15:16:57,804 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 168 [2024-11-08 15:16:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:57,810 INFO L225 Difference]: With dead ends: 1678 [2024-11-08 15:16:57,810 INFO L226 Difference]: Without dead ends: 1101 [2024-11-08 15:16:57,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 361 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=887, Invalid=3943, Unknown=0, NotChecked=0, Total=4830 [2024-11-08 15:16:57,815 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 819 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:57,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1364 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 15:16:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-08 15:16:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1029. [2024-11-08 15:16:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 783 states have (on average 1.1507024265644956) internal successors, (901), 825 states have internal predecessors, (901), 132 states have call successors, (132), 115 states have call predecessors, (132), 113 states have return successors, (155), 117 states have call predecessors, (155), 132 states have call successors, (155) [2024-11-08 15:16:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1188 transitions. [2024-11-08 15:16:57,900 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1188 transitions. Word has length 168 [2024-11-08 15:16:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1188 transitions. [2024-11-08 15:16:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.5) internal successors, (210), 24 states have internal predecessors, (210), 9 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2024-11-08 15:16:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1188 transitions. [2024-11-08 15:16:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 15:16:57,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:57,906 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:57,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:16:58,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:16:58,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 126290915, now seen corresponding path program 1 times [2024-11-08 15:16:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105508568] [2024-11-08 15:16:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:16:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:16:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:16:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:16:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:16:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:16:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 15:16:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:16:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:16:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 15:16:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:16:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 15:16:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:16:58,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:58,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105508568] [2024-11-08 15:16:58,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105508568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:58,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759838862] [2024-11-08 15:16:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:58,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:58,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:58,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:16:58,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:16:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:16:58,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 175 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 15:16:58,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 99 proven. 53 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 15:16:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759838862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:59,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 22 [2024-11-08 15:16:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675806645] [2024-11-08 15:16:59,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 15:16:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 15:16:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-08 15:16:59,097 INFO L87 Difference]: Start difference. First operand 1029 states and 1188 transitions. Second operand has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) [2024-11-08 15:17:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:00,456 INFO L93 Difference]: Finished difference Result 2002 states and 2342 transitions. [2024-11-08 15:17:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-08 15:17:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) Word has length 184 [2024-11-08 15:17:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:00,465 INFO L225 Difference]: With dead ends: 2002 [2024-11-08 15:17:00,465 INFO L226 Difference]: Without dead ends: 1077 [2024-11-08 15:17:00,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1807, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 15:17:00,471 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 516 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:00,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 406 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:17:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-08 15:17:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1027. [2024-11-08 15:17:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 783 states have (on average 1.1392081736909323) internal successors, (892), 823 states have internal predecessors, (892), 126 states have call successors, (126), 117 states have call predecessors, (126), 117 states have return successors, (149), 115 states have call predecessors, (149), 126 states have call successors, (149) [2024-11-08 15:17:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1167 transitions. [2024-11-08 15:17:00,614 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1167 transitions. Word has length 184 [2024-11-08 15:17:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1167 transitions. [2024-11-08 15:17:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.863636363636363) internal successors, (217), 15 states have internal predecessors, (217), 7 states have call successors, (38), 8 states have call predecessors, (38), 11 states have return successors, (33), 10 states have call predecessors, (33), 7 states have call successors, (33) [2024-11-08 15:17:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1167 transitions. [2024-11-08 15:17:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 15:17:00,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:00,620 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:00,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:17:00,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:00,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2113019229, now seen corresponding path program 1 times [2024-11-08 15:17:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152058256] [2024-11-08 15:17:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:17:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:17:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:17:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:17:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:17:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 15:17:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:17:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 15:17:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 15:17:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:17:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 15:17:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 86 proven. 43 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-08 15:17:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152058256] [2024-11-08 15:17:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152058256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222160928] [2024-11-08 15:17:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:01,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:01,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:17:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:17:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:17:01,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 122 proven. 26 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-08 15:17:01,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 95 proven. 45 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 15:17:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222160928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:02,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 13] total 23 [2024-11-08 15:17:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529415100] [2024-11-08 15:17:02,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:02,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:17:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:17:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:17:02,243 INFO L87 Difference]: Start difference. First operand 1027 states and 1167 transitions. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-08 15:17:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:03,781 INFO L93 Difference]: Finished difference Result 1894 states and 2201 transitions. [2024-11-08 15:17:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 15:17:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) Word has length 185 [2024-11-08 15:17:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:03,784 INFO L225 Difference]: With dead ends: 1894 [2024-11-08 15:17:03,785 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:17:03,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 405 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=844, Invalid=2816, Unknown=0, NotChecked=0, Total=3660 [2024-11-08 15:17:03,790 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 651 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:03,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 487 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:17:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:17:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:17:03,791 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) [2024-11-08 15:17:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:17:03,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2024-11-08 15:17:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:03,811 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:17:03,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 19 states have internal predecessors, (217), 13 states have call successors, (39), 11 states have call predecessors, (39), 13 states have return successors, (35), 13 states have call predecessors, (35), 13 states have call successors, (35) [2024-11-08 15:17:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:17:03,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:17:03,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:17:03,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:17:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:04,018 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:04,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:17:11,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:17:11,894 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) .cse1 .cse2) (and .cse0 (= |old(~methaneLevelCritical~0)| 0) .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) .cse1 .cse2) (and .cse0 (= ~methaneLevelCritical~0 0) .cse1 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-08 15:17:11,910 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= ~pumpRunning~0 |old(~pumpRunning~0)|)) (.cse1 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse3 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse5 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 1 ~systemActive~0)) (.cse4 (= |old(~waterLevel~0)| 2))) (and (or (< 1 |old(~waterLevel~0)|) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~switchedOnBeforeTS~0)) (< |old(~pumpRunning~0)| 1)) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (not .cse4)) (or (and (= ~pumpRunning~0 0) .cse1 .cse3) (not .cse5)) (let ((.cse6 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= |old(~waterLevel~0)| 1) .cse6) (and .cse2 .cse5 (<= |old(~waterLevel~0)| 2)) (and .cse2 .cse6 .cse4)))))) [2024-11-08 15:17:11,921 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 15:17:11,932 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (= |old(~pumpRunning~0)| 0) (<= ~waterLevel~0 2)) (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= ~waterLevel~0 2)) (and (<= 1 ~pumpRunning~0) (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-08 15:17:11,947 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse0 .cse1 .cse4) (and .cse3 (= ~methaneLevelCritical~0 0) .cse1 .cse4 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= ~waterLevel~0 1)) (.cse4 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 (= ~methaneLevelCritical~0 0) .cse3 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse2))) [2024-11-08 15:17:11,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:17:11 BoogieIcfgContainer [2024-11-08 15:17:11,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:17:11,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:17:11,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:17:11,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:17:11,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48" (3/4) ... [2024-11-08 15:17:11,969 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:17:11,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:17:11,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:17:11,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:17:11,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:17:11,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:17:11,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:17:11,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-08 15:17:11,984 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-08 15:17:11,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:17:11,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:17:11,988 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:11,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:12,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:17:12,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:17:12,113 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:17:12,114 INFO L158 Benchmark]: Toolchain (without parser) took 24700.96ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 107.5MB in the beginning and 279.6MB in the end (delta: -172.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,114 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:17:12,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.94ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 146.1MB in the end (delta: -38.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.57ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,115 INFO L158 Benchmark]: Boogie Preprocessor took 55.43ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,116 INFO L158 Benchmark]: RCFGBuilder took 530.98ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 123.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,116 INFO L158 Benchmark]: TraceAbstraction took 23352.56ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 122.3MB in the beginning and 287.0MB in the end (delta: -164.6MB). Peak memory consumption was 209.3MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,117 INFO L158 Benchmark]: Witness Printer took 148.12ms. Allocated memory is still 371.2MB. Free memory was 287.0MB in the beginning and 279.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:17:12,119 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 557.94ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 146.1MB in the end (delta: -38.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.57ms. Allocated memory is still 176.2MB. Free memory was 146.1MB in the beginning and 144.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.43ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 141.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.98ms. Allocated memory is still 176.2MB. Free memory was 141.9MB in the beginning and 123.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23352.56ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 122.3MB in the beginning and 287.0MB in the end (delta: -164.6MB). Peak memory consumption was 209.3MB. Max. memory is 16.1GB. * Witness Printer took 148.12ms. Allocated memory is still 371.2MB. Free memory was 287.0MB in the beginning and 279.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [150] - GenericResultAtLocation [Line: 201]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [201] - GenericResultAtLocation [Line: 304]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [304] - GenericResultAtLocation [Line: 313]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [313] - GenericResultAtLocation [Line: 496]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [496] - GenericResultAtLocation [Line: 561]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [561] - GenericResultAtLocation [Line: 596]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [596] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 309]: 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, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3424 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3387 mSDsluCounter, 5930 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4683 mSDsCounter, 1027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6848 IncrementalHoareTripleChecker+Invalid, 7875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1027 mSolverCounterUnsat, 1247 mSDtfsCounter, 6848 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1729 GetRequests, 1447 SyntacticMatches, 15 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=11, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 286 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1668 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2278 ConstructedInterpolants, 0 QuantifiedInterpolants, 5241 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1884 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 1757/2073 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 506]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((((((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS))) - ProcedureContractResult [Line: 346]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 83]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) Ensures: (((((((pumpRunning < 1) || (2 == waterLevel)) || (\old(methaneLevelCritical) == 0)) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) == 0))) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) && ((\old(methaneLevelCritical) != 0) || (methaneLevelCritical != 0))) && ((((((waterLevel == \old(waterLevel)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 319]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((((0 < \old(waterLevel)) || (\old(waterLevel) == waterLevel)) && ((((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 1)) && (1 <= \old(pumpRunning))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2))) || (((1 == systemActive) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2)))) && (((methaneLevelCritical == 0) || ((pumpRunning == 0) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((1 < \old(waterLevel)) || (waterLevel < 1)) || (\old(pumpRunning) < 1))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && ((((pumpRunning == \old(pumpRunning)) && (1 <= switchedOnBeforeTS)) || (methaneLevelCritical != 0)) || (\old(pumpRunning) < 1))) && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 204]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((methaneLevelCritical == \old(methaneLevelCritical)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 354]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: ((((((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) && ((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || (waterLevel < 2))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS)))) && (((1 < waterLevel) || (0 < \old(pumpRunning))) || ((pumpRunning == 0) && (\old(pumpRunning) == 0)))) && ((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 71]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (2 == waterLevel))) && ((((((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) == 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2))) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)))) && ((((((methaneLevelCritical == \old(methaneLevelCritical)) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 432]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((pumpRunning == \result) && (((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)))) && (((((((waterLevel == \old(waterLevel)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:17:12,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE