./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product46.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 5780768f89256c506186805750dd5ec09f07e7c3b9baffd6ca5edbcb4a88d3de --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:39:26,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:39:26,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:39:26,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:39:26,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:39:26,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:39:26,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:39:26,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:39:26,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:39:26,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:39:26,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:39:26,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:39:26,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:39:26,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:39:26,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:39:26,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:39:26,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:39:26,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:39:26,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:39:26,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:39:26,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:39:26,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:39:26,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:39:26,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:39:26,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:39:26,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:39:26,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:39:26,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:39:26,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:39:26,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:39:26,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:39:26,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:39:26,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:26,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:39:26,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:39:26,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:39:26,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:39:26,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:39:26,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:39:26,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:39:26,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:39:26,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:39:26,609 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 -> 5780768f89256c506186805750dd5ec09f07e7c3b9baffd6ca5edbcb4a88d3de [2024-10-12 19:39:26,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:39:26,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:39:26,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:39:26,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:39:26,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:39:26,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product46.cil.c [2024-10-12 19:39:28,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:39:28,576 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:39:28,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product46.cil.c [2024-10-12 19:39:28,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77eda29b4/de583ca570fb4e6eab75e0faf665820c/FLAGa8c80583f [2024-10-12 19:39:28,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77eda29b4/de583ca570fb4e6eab75e0faf665820c [2024-10-12 19:39:28,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:39:28,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:39:28,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:28,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:39:28,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:39:28,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:28" (1/1) ... [2024-10-12 19:39:28,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76fa2bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:28, skipping insertion in model container [2024-10-12 19:39:28,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:28" (1/1) ... [2024-10-12 19:39:28,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:39:28,953 WARN L248 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_spec1_product46.cil.c[7019,7032] [2024-10-12 19:39:29,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:29,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:39:29,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-10-12 19:39:29,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-10-12 19:39:29,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [333] [2024-10-12 19:39:29,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2024-10-12 19:39:29,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [467] [2024-10-12 19:39:29,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [476] [2024-10-12 19:39:29,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [502] [2024-10-12 19:39:29,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [597] [2024-10-12 19:39:29,091 WARN L248 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_spec1_product46.cil.c[7019,7032] [2024-10-12 19:39:29,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:29,160 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:39:29,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29 WrapperNode [2024-10-12 19:39:29,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:29,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:29,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:39:29,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:39:29,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,206 INFO L138 Inliner]: procedures = 55, calls = 100, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 188 [2024-10-12 19:39:29,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:29,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:39:29,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:39:29,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:39:29,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,237 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-10-12 19:39:29,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:39:29,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:39:29,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:39:29,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:39:29,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (1/1) ... [2024-10-12 19:39:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:29,292 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-10-12 19:39:29,295 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-10-12 19:39:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:39:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:39:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:39:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:39:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:39:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:39:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:39:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:39:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:39:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:39:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:39:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-10-12 19:39:29,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-10-12 19:39:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:39:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:39:29,345 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:39:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:39:29,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:39:29,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:39:29,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:39:29,753 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-10-12 19:39:29,753 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:39:29,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:39:29,823 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:39:29,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29 BoogieIcfgContainer [2024-10-12 19:39:29,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:39:29,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:39:29,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:39:29,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:39:29,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:39:28" (1/3) ... [2024-10-12 19:39:29,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52276761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:29, skipping insertion in model container [2024-10-12 19:39:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:29" (2/3) ... [2024-10-12 19:39:29,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52276761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:29, skipping insertion in model container [2024-10-12 19:39:29,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29" (3/3) ... [2024-10-12 19:39:29,838 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product46.cil.c [2024-10-12 19:39:29,859 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:39:29,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:39:29,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:39:29,922 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;@443b6bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:39:29,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:39:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 59 states have internal predecessors, (77), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 19:39:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:39:29,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:29,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:29,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1561894303, now seen corresponding path program 1 times [2024-10-12 19:39:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684290382] [2024-10-12 19:39:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:39:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:30,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684290382] [2024-10-12 19:39:30,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684290382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:39:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892754941] [2024-10-12 19:39:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:39:30,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:39:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:30,162 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 59 states have internal predecessors, (77), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,237 INFO L93 Difference]: Finished difference Result 148 states and 211 transitions. [2024-10-12 19:39:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:39:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 19:39:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,249 INFO L225 Difference]: With dead ends: 148 [2024-10-12 19:39:30,249 INFO L226 Difference]: Without dead ends: 70 [2024-10-12 19:39:30,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-10-12 19:39:30,257 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-12 19:39:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-12 19:39:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 55 states have internal predecessors, (67), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-12 19:39:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2024-10-12 19:39:30,311 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 16 [2024-10-12 19:39:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2024-10-12 19:39:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2024-10-12 19:39:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:39:30,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:39:30,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2036669376, now seen corresponding path program 1 times [2024-10-12 19:39:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082894105] [2024-10-12 19:39:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:39:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082894105] [2024-10-12 19:39:30,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082894105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957031136] [2024-10-12 19:39:30,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,466 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,517 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2024-10-12 19:39:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:30,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 19:39:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,519 INFO L225 Difference]: With dead ends: 113 [2024-10-12 19:39:30,519 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 19:39:30,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-12 19:39:30,522 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 19:39:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-12 19:39:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 50 states have internal predecessors, (61), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 19:39:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-10-12 19:39:30,539 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 17 [2024-10-12 19:39:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-10-12 19:39:30,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-10-12 19:39:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 19:39:30,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:39:30,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 416353843, now seen corresponding path program 1 times [2024-10-12 19:39:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518393991] [2024-10-12 19:39:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:30,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518393991] [2024-10-12 19:39:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518393991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401824031] [2024-10-12 19:39:30,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:30,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:30,722 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:30,774 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2024-10-12 19:39:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-12 19:39:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:30,777 INFO L225 Difference]: With dead ends: 122 [2024-10-12 19:39:30,778 INFO L226 Difference]: Without dead ends: 62 [2024-10-12 19:39:30,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10-12 19:39:30,780 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:30,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-12 19:39:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-12 19:39:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 50 states have internal predecessors, (60), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-12 19:39:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-10-12 19:39:30,795 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 20 [2024-10-12 19:39:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:30,797 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-10-12 19:39:30,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-10-12 19:39:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 19:39:30,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:30,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-10-12 19:39:30,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:39:30,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1907888214, now seen corresponding path program 1 times [2024-10-12 19:39:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000793179] [2024-10-12 19:39:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:39:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:39:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000793179] [2024-10-12 19:39:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000793179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:30,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170711639] [2024-10-12 19:39:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:30,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:30,934 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:39:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:31,217 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2024-10-12 19:39:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:39:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (4), 2 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 30 [2024-10-12 19:39:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:31,219 INFO L225 Difference]: With dead ends: 189 [2024-10-12 19:39:31,219 INFO L226 Difference]: Without dead ends: 129 [2024-10-12 19:39:31,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:31,224 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 154 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:31,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 178 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-12 19:39:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-12 19:39:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.313953488372093) internal successors, (113), 94 states have internal predecessors, (113), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-10-12 19:39:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2024-10-12 19:39:31,258 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 30 [2024-10-12 19:39:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:31,260 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2024-10-12 19:39:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:39:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2024-10-12 19:39:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:39:31,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:31,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 19:39:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:39:31,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1793543999, now seen corresponding path program 1 times [2024-10-12 19:39:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723181419] [2024-10-12 19:39:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:39:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723181419] [2024-10-12 19:39:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723181419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:31,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:39:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470563531] [2024-10-12 19:39:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:31,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:39:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:39:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:39:31,400 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:31,659 INFO L93 Difference]: Finished difference Result 331 states and 436 transitions. [2024-10-12 19:39:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:39:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-10-12 19:39:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:31,663 INFO L225 Difference]: With dead ends: 331 [2024-10-12 19:39:31,663 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 19:39:31,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 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-10-12 19:39:31,666 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 127 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:31,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 216 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 19:39:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2024-10-12 19:39:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 156 states have internal predecessors, (190), 30 states have call successors, (30), 26 states have call predecessors, (30), 28 states have return successors, (40), 30 states have call predecessors, (40), 30 states have call successors, (40) [2024-10-12 19:39:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 260 transitions. [2024-10-12 19:39:31,695 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 260 transitions. Word has length 35 [2024-10-12 19:39:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 260 transitions. [2024-10-12 19:39:31,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:39:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 260 transitions. [2024-10-12 19:39:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:39:31,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:31,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 19:39:31,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:39:31,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:31,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash -812479555, now seen corresponding path program 1 times [2024-10-12 19:39:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345076388] [2024-10-12 19:39:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:39:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345076388] [2024-10-12 19:39:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345076388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176050057] [2024-10-12 19:39:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:31,868 INFO L87 Difference]: Start difference. First operand 204 states and 260 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:39:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:32,067 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2024-10-12 19:39:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:39:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-12 19:39:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:32,070 INFO L225 Difference]: With dead ends: 208 [2024-10-12 19:39:32,071 INFO L226 Difference]: Without dead ends: 206 [2024-10-12 19:39:32,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:32,072 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 108 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:32,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 161 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-12 19:39:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-10-12 19:39:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 145 states have (on average 1.289655172413793) internal successors, (187), 156 states have internal predecessors, (187), 30 states have call successors, (30), 26 states have call predecessors, (30), 28 states have return successors, (40), 30 states have call predecessors, (40), 30 states have call successors, (40) [2024-10-12 19:39:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 257 transitions. [2024-10-12 19:39:32,104 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 257 transitions. Word has length 35 [2024-10-12 19:39:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:32,104 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 257 transitions. [2024-10-12 19:39:32,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:39:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 257 transitions. [2024-10-12 19:39:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:32,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:32,107 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:39:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:39:32,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2137349814, now seen corresponding path program 1 times [2024-10-12 19:39:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440266796] [2024-10-12 19:39:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440266796] [2024-10-12 19:39:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440266796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:39:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413600309] [2024-10-12 19:39:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:39:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:39:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:39:32,221 INFO L87 Difference]: Start difference. First operand 204 states and 257 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:32,374 INFO L93 Difference]: Finished difference Result 412 states and 531 transitions. [2024-10-12 19:39:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:39:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:39:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:32,377 INFO L225 Difference]: With dead ends: 412 [2024-10-12 19:39:32,377 INFO L226 Difference]: Without dead ends: 210 [2024-10-12 19:39:32,378 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-10-12 19:39:32,379 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:32,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 172 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-12 19:39:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-10-12 19:39:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 160 states have internal predecessors, (191), 30 states have call successors, (30), 26 states have call predecessors, (30), 28 states have return successors, (40), 30 states have call predecessors, (40), 30 states have call successors, (40) [2024-10-12 19:39:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2024-10-12 19:39:32,410 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 42 [2024-10-12 19:39:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:32,411 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2024-10-12 19:39:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2024-10-12 19:39:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:39:32,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:32,413 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:39:32,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:39:32,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2003336308, now seen corresponding path program 1 times [2024-10-12 19:39:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72064764] [2024-10-12 19:39:32,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:39:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:39:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72064764] [2024-10-12 19:39:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72064764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:39:32,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122676623] [2024-10-12 19:39:32,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:32,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:39:32,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:39:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:39:32,533 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:32,690 INFO L93 Difference]: Finished difference Result 376 states and 475 transitions. [2024-10-12 19:39:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:39:32,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:39:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:32,693 INFO L225 Difference]: With dead ends: 376 [2024-10-12 19:39:32,693 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 19:39:32,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 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-10-12 19:39:32,694 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 117 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:32,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 153 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 19:39:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2024-10-12 19:39:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.25) internal successors, (150), 129 states have internal predecessors, (150), 24 states have call successors, (24), 21 states have call predecessors, (24), 23 states have return successors, (29), 24 states have call predecessors, (29), 24 states have call successors, (29) [2024-10-12 19:39:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2024-10-12 19:39:32,709 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 42 [2024-10-12 19:39:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:32,709 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2024-10-12 19:39:32,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:39:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2024-10-12 19:39:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:39:32,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:32,711 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:39:32,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:39:32,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:32,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash -822429224, now seen corresponding path program 1 times [2024-10-12 19:39:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:32,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660431608] [2024-10-12 19:39:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:39:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:39:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660431608] [2024-10-12 19:39:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660431608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:39:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105396138] [2024-10-12 19:39:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:32,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:39:32,867 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:39:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:33,371 INFO L93 Difference]: Finished difference Result 549 states and 679 transitions. [2024-10-12 19:39:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:39:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2024-10-12 19:39:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:33,374 INFO L225 Difference]: With dead ends: 549 [2024-10-12 19:39:33,374 INFO L226 Difference]: Without dead ends: 383 [2024-10-12 19:39:33,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:39:33,378 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 251 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:33,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 200 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:39:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-12 19:39:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 331. [2024-10-12 19:39:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 253 states have internal predecessors, (284), 48 states have call successors, (48), 42 states have call predecessors, (48), 48 states have return successors, (63), 48 states have call predecessors, (63), 48 states have call successors, (63) [2024-10-12 19:39:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 395 transitions. [2024-10-12 19:39:33,419 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 395 transitions. Word has length 46 [2024-10-12 19:39:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 395 transitions. [2024-10-12 19:39:33,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:39:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 395 transitions. [2024-10-12 19:39:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:39:33,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:33,421 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:39:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:39:33,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1494620932, now seen corresponding path program 1 times [2024-10-12 19:39:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554487981] [2024-10-12 19:39:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:39:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:39:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:39:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:39:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554487981] [2024-10-12 19:39:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554487981] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392437262] [2024-10-12 19:39:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:33,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:33,633 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-10-12 19:39:33,636 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-10-12 19:39:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:33,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:39:33,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:33,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:33,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392437262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:33,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:33,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2024-10-12 19:39:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590695951] [2024-10-12 19:39:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:33,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:33,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:33,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:39:33,942 INFO L87 Difference]: Start difference. First operand 331 states and 395 transitions. Second operand has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:39:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:34,153 INFO L93 Difference]: Finished difference Result 647 states and 775 transitions. [2024-10-12 19:39:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:39:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-10-12 19:39:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:34,156 INFO L225 Difference]: With dead ends: 647 [2024-10-12 19:39:34,156 INFO L226 Difference]: Without dead ends: 318 [2024-10-12 19:39:34,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:39:34,158 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 51 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:34,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 550 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-12 19:39:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-12 19:39:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 225 states have (on average 1.1955555555555555) internal successors, (269), 243 states have internal predecessors, (269), 47 states have call successors, (47), 41 states have call predecessors, (47), 45 states have return successors, (56), 46 states have call predecessors, (56), 47 states have call successors, (56) [2024-10-12 19:39:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 372 transitions. [2024-10-12 19:39:34,185 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 372 transitions. Word has length 50 [2024-10-12 19:39:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:34,186 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 372 transitions. [2024-10-12 19:39:34,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:39:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 372 transitions. [2024-10-12 19:39:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:39:34,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:34,188 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-10-12 19:39:34,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:39:34,388 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-10-12 19:39:34,389 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:34,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -517385475, now seen corresponding path program 1 times [2024-10-12 19:39:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:34,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420996440] [2024-10-12 19:39:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:39:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:39:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:39:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:39:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:39:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:39:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:39:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:39:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:39:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:39:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420996440] [2024-10-12 19:39:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420996440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:39:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734257162] [2024-10-12 19:39:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:39:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:34,694 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-10-12 19:39:34,696 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-10-12 19:39:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:34,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:39:34,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:39:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:39:34,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:39:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734257162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:39:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 19 [2024-10-12 19:39:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676429101] [2024-10-12 19:39:34,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:34,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:39:34,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:39:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:39:34,903 INFO L87 Difference]: Start difference. First operand 318 states and 372 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:39:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:35,067 INFO L93 Difference]: Finished difference Result 522 states and 615 transitions. [2024-10-12 19:39:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:39:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 89 [2024-10-12 19:39:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:35,070 INFO L225 Difference]: With dead ends: 522 [2024-10-12 19:39:35,070 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:39:35,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:39:35,072 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:35,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 688 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:39:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:39:35,073 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-10-12 19:39:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:39:35,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-10-12 19:39:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:39:35,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:39:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:39:35,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:39:35,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:39:35,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:39:35,280 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-10-12 19:39:35,283 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:35,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:39:37,251 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:39:37,274 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse1 (= |old(~methaneLevelCritical~0)| 0))) (and (or (<= 1 ~methaneLevelCritical~0) (< |old(~methaneLevelCritical~0)| 1)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) (<= 1 |old(~methaneLevelCritical~0)|) .cse0) (and .cse1 .cse0))) (or (not .cse1) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse1 (= |old(~methaneLevelCritical~0)| 0))) (and (or (< |old(~methaneLevelCritical~0)| 1) (< 0 ~methaneLevelCritical~0)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) (<= 1 |old(~methaneLevelCritical~0)|) .cse0) (and .cse1 .cse0))) (or (not .cse1) (= ~methaneLevelCritical~0 0))))) [2024-10-12 19:39:37,277 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:39:37,283 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) .cse0))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) .cse0))) [2024-10-12 19:39:37,290 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0) (and (= ~pumpRunning~0 0) (<= 1 ~methaneLevelCritical~0) .cse0))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0) (and (= ~pumpRunning~0 0) (<= 1 ~methaneLevelCritical~0) .cse0))) [2024-10-12 19:39:37,293 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0) (and (<= 1 ~methaneLevelCritical~0) .cse0 (= |old(~pumpRunning~0)| 0))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0) (and (= ~pumpRunning~0 0) (<= 1 ~methaneLevelCritical~0) .cse0))) [2024-10-12 19:39:37,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:39:37 BoogieIcfgContainer [2024-10-12 19:39:37,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:39:37,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:39:37,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:39:37,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:39:37,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:29" (3/4) ... [2024-10-12 19:39:37,319 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:39:37,323 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:39:37,323 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-10-12 19:39:37,324 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-10-12 19:39:37,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2024-10-12 19:39:37,335 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:39:37,336 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:39:37,336 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:37,336 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:39:37,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:39:37,459 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:39:37,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:39:37,459 INFO L158 Benchmark]: Toolchain (without parser) took 8857.17ms. Allocated memory was 132.1MB in the beginning and 230.7MB in the end (delta: 98.6MB). Free memory was 75.9MB in the beginning and 188.0MB in the end (delta: -112.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:39:37,460 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:39:37,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.21ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 75.6MB in the beginning and 146.7MB in the end (delta: -71.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.62ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 144.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,460 INFO L158 Benchmark]: Boogie Preprocessor took 52.94ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,461 INFO L158 Benchmark]: RCFGBuilder took 562.65ms. Allocated memory is still 184.5MB. Free memory was 141.4MB in the beginning and 119.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,461 INFO L158 Benchmark]: TraceAbstraction took 7490.02ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 118.3MB in the beginning and 195.4MB in the end (delta: -77.1MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,462 INFO L158 Benchmark]: Witness Printer took 142.30ms. Allocated memory is still 230.7MB. Free memory was 195.4MB in the beginning and 188.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:39:37,463 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.17ms. Allocated memory is still 132.1MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.21ms. Allocated memory was 132.1MB in the beginning and 184.5MB in the end (delta: 52.4MB). Free memory was 75.6MB in the beginning and 146.7MB in the end (delta: -71.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.62ms. Allocated memory is still 184.5MB. Free memory was 146.7MB in the beginning and 144.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.94ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.65ms. Allocated memory is still 184.5MB. Free memory was 141.4MB in the beginning and 119.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7490.02ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 118.3MB in the beginning and 195.4MB in the end (delta: -77.1MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * Witness Printer took 142.30ms. Allocated memory is still 230.7MB. Free memory was 195.4MB in the beginning and 188.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 333]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [333] - GenericResultAtLocation [Line: 432]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] - GenericResultAtLocation [Line: 467]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [467] - GenericResultAtLocation [Line: 476]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [476] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [502] - GenericResultAtLocation [Line: 597]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [597] - 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: 472]: 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 9 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1034 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 994 mSDsluCounter, 2605 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1803 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1525 IncrementalHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 802 mSDtfsCounter, 1525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=9, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 548 ConstructedInterpolants, 0 QuantifiedInterpolants, 958 SizeOfPredicates, 1 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 78/82 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: 65]: Loop Invariant Derived loop invariant: ((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 158]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) - ProcedureContractResult [Line: 530]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical)) && ((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive)) || ((\old(methaneLevelCritical) == 0) && (1 == systemActive)))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 542]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) Ensures: ((((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) && (\result == methaneLevelCritical)) - ProcedureContractResult [Line: 335]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 134]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) || (methaneLevelCritical < 1)) && (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive)))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (\old(waterLevel) == waterLevel))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (\old(waterLevel) != 1))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 518]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) - ProcedureContractResult [Line: 166]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: (((methaneLevelCritical == 0) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: (((((pumpRunning == 0) || (methaneLevelCritical < 1)) && (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive)))) && (((waterLevel != 1) || (\old(pumpRunning) != 0)) || (pumpRunning == 0))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) == 0))) - ProcedureContractResult [Line: 250]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive))) Ensures: (((methaneLevelCritical < ((long long) \result + 1)) || (methaneLevelCritical < 1)) && (((1 <= methaneLevelCritical) && (1 == systemActive)) || ((methaneLevelCritical == 0) && (1 == systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:39:37,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE