./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product45.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 ba9a436826b937f0c5d07c40f29a0f312221efc7ce174fd7c7535766b753ea6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:55:04,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:55:04,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:55:04,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:55:04,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:55:04,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:55:04,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:55:04,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:55:04,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:55:04,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:55:04,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:55:04,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:55:04,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:55:04,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:55:04,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:55:04,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:55:04,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:55:04,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:55:04,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:55:04,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:55:04,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:55:04,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:55:04,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:55:04,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:55:04,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:55:04,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:55:04,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:55:04,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:55:04,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:55:04,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:55:04,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:55:04,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:55:04,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:04,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:55:04,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:55:04,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:55:04,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:55:04,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:55:04,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:55:04,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:55:04,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:55:04,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:55:04,756 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 -> ba9a436826b937f0c5d07c40f29a0f312221efc7ce174fd7c7535766b753ea6d [2024-11-11 20:55:05,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:55:05,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:55:05,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:55:05,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:55:05,055 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:55:05,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2024-11-11 20:55:06,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:55:06,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:55:06,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2024-11-11 20:55:06,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a2b7de0/7de50750dbed4571856e232229abe805/FLAG6b8ed866a [2024-11-11 20:55:06,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55a2b7de0/7de50750dbed4571856e232229abe805 [2024-11-11 20:55:06,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:55:06,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:55:06,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:06,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:55:06,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:55:06,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:06" (1/1) ... [2024-11-11 20:55:06,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a48effa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:06, skipping insertion in model container [2024-11-11 20:55:06,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:06" (1/1) ... [2024-11-11 20:55:06,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:55:07,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c[5266,5279] [2024-11-11 20:55:07,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:07,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:55:07,256 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-11 20:55:07,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] [2024-11-11 20:55:07,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [322] [2024-11-11 20:55:07,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [331] [2024-11-11 20:55:07,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [697] [2024-11-11 20:55:07,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [724] [2024-11-11 20:55:07,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [823] [2024-11-11 20:55:07,263 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [917] [2024-11-11 20:55:07,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c[5266,5279] [2024-11-11 20:55:07,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:07,353 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:55:07,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07 WrapperNode [2024-11-11 20:55:07,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:07,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:07,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:55:07,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:55:07,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,410 INFO L138 Inliner]: procedures = 54, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 206 [2024-11-11 20:55:07,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:07,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:55:07,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:55:07,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:55:07,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,444 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:55:07,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:55:07,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:55:07,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:55:07,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:55:07,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (1/1) ... [2024-11-11 20:55:07,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:07,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:55:07,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:55:07,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:55:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:55:07,559 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:55:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:55:07,559 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:55:07,559 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:55:07,560 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:55:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:55:07,560 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:55:07,560 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:55:07,561 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:55:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-11 20:55:07,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-11 20:55:07,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:55:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:55:07,562 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:55:07,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:55:07,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:55:07,635 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:55:07,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:55:07,872 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-11 20:55:07,872 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:55:07,892 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:55:07,892 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:55:07,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:07 BoogieIcfgContainer [2024-11-11 20:55:07,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:55:07,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:55:07,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:55:07,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:55:07,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:55:06" (1/3) ... [2024-11-11 20:55:07,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9006d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:07, skipping insertion in model container [2024-11-11 20:55:07,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:07" (2/3) ... [2024-11-11 20:55:07,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9006d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:07, skipping insertion in model container [2024-11-11 20:55:07,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:07" (3/3) ... [2024-11-11 20:55:07,901 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product45.cil.c [2024-11-11 20:55:07,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:55:07,915 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:55:07,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:55:07,997 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;@33f17a14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:55:07,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:55:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:55:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:55:08,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:08,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:08,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:08,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 657665153, now seen corresponding path program 1 times [2024-11-11 20:55:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:08,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249472968] [2024-11-11 20:55:08,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249472968] [2024-11-11 20:55:08,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249472968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:08,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:08,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210079649] [2024-11-11 20:55:08,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:08,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:55:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:55:08,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:08,246 INFO L87 Difference]: Start difference. First operand has 88 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:08,292 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2024-11-11 20:55:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:55:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-11 20:55:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:08,303 INFO L225 Difference]: With dead ends: 168 [2024-11-11 20:55:08,303 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 20:55:08,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:08,309 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:08,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:08,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 20:55:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-11 20:55:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 67 states have internal predecessors, (79), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:55:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-11-11 20:55:08,352 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 19 [2024-11-11 20:55:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:08,352 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-11-11 20:55:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-11-11 20:55:08,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 20:55:08,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:08,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:55:08,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -635016862, now seen corresponding path program 1 times [2024-11-11 20:55:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009274165] [2024-11-11 20:55:08,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:08,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:08,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009274165] [2024-11-11 20:55:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009274165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:08,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171511007] [2024-11-11 20:55:08,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:08,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:08,466 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:08,489 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2024-11-11 20:55:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:08,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 20:55:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:08,491 INFO L225 Difference]: With dead ends: 124 [2024-11-11 20:55:08,492 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 20:55:08,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:08,494 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:08,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 20:55:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 20:55:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 61 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-11 20:55:08,511 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 20 [2024-11-11 20:55:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:08,511 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-11 20:55:08,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-11 20:55:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 20:55:08,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:08,517 INFO L218 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] [2024-11-11 20:55:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:55:08,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 393763767, now seen corresponding path program 1 times [2024-11-11 20:55:08,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:08,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635715894] [2024-11-11 20:55:08,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:08,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635715894] [2024-11-11 20:55:08,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635715894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:08,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:08,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355044593] [2024-11-11 20:55:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:08,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:08,671 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:08,691 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2024-11-11 20:55:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 20:55:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:08,695 INFO L225 Difference]: With dead ends: 133 [2024-11-11 20:55:08,697 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 20:55:08,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:08,699 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:08,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 20:55:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 20:55:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 61 states have internal predecessors, (71), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-11 20:55:08,721 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 24 [2024-11-11 20:55:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:08,722 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-11 20:55:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:55:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-11 20:55:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:55:08,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:08,724 INFO L218 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] [2024-11-11 20:55:08,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:55:08,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:08,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1897865398, now seen corresponding path program 1 times [2024-11-11 20:55:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:08,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892758165] [2024-11-11 20:55:08,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:08,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892758165] [2024-11-11 20:55:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892758165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:55:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104321050] [2024-11-11 20:55:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:55:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:55:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:55:08,886 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:09,153 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2024-11-11 20:55:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:55:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-11 20:55:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:09,155 INFO L225 Difference]: With dead ends: 200 [2024-11-11 20:55:09,155 INFO L226 Difference]: Without dead ends: 137 [2024-11-11 20:55:09,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:09,157 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 176 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:09,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 229 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-11 20:55:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2024-11-11 20:55:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 111 states have internal predecessors, (130), 12 states have call successors, (12), 12 states have call predecessors, (12), 15 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-11 20:55:09,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 159 transitions. [2024-11-11 20:55:09,189 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 159 transitions. Word has length 34 [2024-11-11 20:55:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:09,190 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 159 transitions. [2024-11-11 20:55:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2024-11-11 20:55:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-11 20:55:09,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:09,192 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-11 20:55:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:55:09,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1288107246, now seen corresponding path program 1 times [2024-11-11 20:55:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861011307] [2024-11-11 20:55:09,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:09,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861011307] [2024-11-11 20:55:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861011307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:09,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:09,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471769942] [2024-11-11 20:55:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:09,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:09,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:09,371 INFO L87 Difference]: Start difference. First operand 131 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:09,583 INFO L93 Difference]: Finished difference Result 334 states and 425 transitions. [2024-11-11 20:55:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:55:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-11 20:55:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:09,586 INFO L225 Difference]: With dead ends: 334 [2024-11-11 20:55:09,589 INFO L226 Difference]: Without dead ends: 210 [2024-11-11 20:55:09,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:09,591 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 124 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:09,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 262 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-11 20:55:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-11-11 20:55:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 163 states have (on average 1.2515337423312884) internal successors, (204), 174 states have internal predecessors, (204), 21 states have call successors, (21), 21 states have call predecessors, (21), 23 states have return successors, (31), 21 states have call predecessors, (31), 21 states have call successors, (31) [2024-11-11 20:55:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 256 transitions. [2024-11-11 20:55:09,630 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 256 transitions. Word has length 40 [2024-11-11 20:55:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 256 transitions. [2024-11-11 20:55:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:55:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 256 transitions. [2024-11-11 20:55:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:55:09,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:09,635 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:09,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:55:09,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1416737492, now seen corresponding path program 1 times [2024-11-11 20:55:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620324171] [2024-11-11 20:55:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:09,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620324171] [2024-11-11 20:55:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620324171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644452917] [2024-11-11 20:55:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:09,766 INFO L87 Difference]: Start difference. First operand 208 states and 256 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,140 INFO L93 Difference]: Finished difference Result 244 states and 296 transitions. [2024-11-11 20:55:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:55:10,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-11 20:55:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,144 INFO L225 Difference]: With dead ends: 244 [2024-11-11 20:55:10,144 INFO L226 Difference]: Without dead ends: 242 [2024-11-11 20:55:10,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:55:10,145 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 195 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:10,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 279 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-11 20:55:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2024-11-11 20:55:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 187 states have (on average 1.2299465240641712) internal successors, (230), 202 states have internal predecessors, (230), 23 states have call successors, (23), 21 states have call predecessors, (23), 27 states have return successors, (37), 23 states have call predecessors, (37), 23 states have call successors, (37) [2024-11-11 20:55:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 290 transitions. [2024-11-11 20:55:10,184 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 290 transitions. Word has length 44 [2024-11-11 20:55:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,185 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 290 transitions. [2024-11-11 20:55:10,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 290 transitions. [2024-11-11 20:55:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:55:10,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,189 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:10,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:55:10,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash -401607229, now seen corresponding path program 1 times [2024-11-11 20:55:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749072365] [2024-11-11 20:55:10,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749072365] [2024-11-11 20:55:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749072365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:10,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089603871] [2024-11-11 20:55:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:10,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:10,299 INFO L87 Difference]: Start difference. First operand 238 states and 290 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,530 INFO L93 Difference]: Finished difference Result 479 states and 595 transitions. [2024-11-11 20:55:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:55:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-11 20:55:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,534 INFO L225 Difference]: With dead ends: 479 [2024-11-11 20:55:10,534 INFO L226 Difference]: Without dead ends: 248 [2024-11-11 20:55:10,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:10,538 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 123 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:10,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 287 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-11 20:55:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2024-11-11 20:55:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.2227979274611398) internal successors, (236), 208 states have internal predecessors, (236), 23 states have call successors, (23), 21 states have call predecessors, (23), 27 states have return successors, (37), 23 states have call predecessors, (37), 23 states have call successors, (37) [2024-11-11 20:55:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 296 transitions. [2024-11-11 20:55:10,565 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 296 transitions. Word has length 50 [2024-11-11 20:55:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,566 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 296 transitions. [2024-11-11 20:55:10,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 296 transitions. [2024-11-11 20:55:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:55:10,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,570 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:10,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:55:10,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -182752511, now seen corresponding path program 1 times [2024-11-11 20:55:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982474391] [2024-11-11 20:55:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982474391] [2024-11-11 20:55:10,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982474391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:10,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:10,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:10,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932370360] [2024-11-11 20:55:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:10,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:10,703 INFO L87 Difference]: Start difference. First operand 244 states and 296 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,928 INFO L93 Difference]: Finished difference Result 447 states and 547 transitions. [2024-11-11 20:55:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:55:10,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 4 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 50 [2024-11-11 20:55:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,931 INFO L225 Difference]: With dead ends: 447 [2024-11-11 20:55:10,931 INFO L226 Difference]: Without dead ends: 210 [2024-11-11 20:55:10,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:55:10,932 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 210 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 214 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-11 20:55:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 178. [2024-11-11 20:55:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 140 states have (on average 1.2142857142857142) internal successors, (170), 150 states have internal predecessors, (170), 17 states have call successors, (17), 17 states have call predecessors, (17), 20 states have return successors, (23), 17 states have call predecessors, (23), 17 states have call successors, (23) [2024-11-11 20:55:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 210 transitions. [2024-11-11 20:55:10,953 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 210 transitions. Word has length 50 [2024-11-11 20:55:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,954 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 210 transitions. [2024-11-11 20:55:10,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 210 transitions. [2024-11-11 20:55:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:55:10,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,955 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:55:10,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,957 INFO L85 PathProgramCache]: Analyzing trace with hash -316766017, now seen corresponding path program 1 times [2024-11-11 20:55:10,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273304375] [2024-11-11 20:55:10,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273304375] [2024-11-11 20:55:11,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273304375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:11,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:11,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:11,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744806449] [2024-11-11 20:55:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:11,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:11,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:11,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:11,083 INFO L87 Difference]: Start difference. First operand 178 states and 210 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:11,399 INFO L93 Difference]: Finished difference Result 393 states and 495 transitions. [2024-11-11 20:55:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:55:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-11 20:55:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:11,402 INFO L225 Difference]: With dead ends: 393 [2024-11-11 20:55:11,402 INFO L226 Difference]: Without dead ends: 262 [2024-11-11 20:55:11,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:55:11,404 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 175 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:11,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 369 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-11 20:55:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2024-11-11 20:55:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 204 states have (on average 1.2107843137254901) internal successors, (247), 218 states have internal predecessors, (247), 27 states have call successors, (27), 25 states have call predecessors, (27), 28 states have return successors, (44), 27 states have call predecessors, (44), 27 states have call successors, (44) [2024-11-11 20:55:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 318 transitions. [2024-11-11 20:55:11,423 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 318 transitions. Word has length 50 [2024-11-11 20:55:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:11,423 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 318 transitions. [2024-11-11 20:55:11,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 318 transitions. [2024-11-11 20:55:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 20:55:11,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:11,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:11,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:55:11,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1655738174, now seen corresponding path program 1 times [2024-11-11 20:55:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181242223] [2024-11-11 20:55:11,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 20:55:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:55:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:55:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 20:55:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181242223] [2024-11-11 20:55:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181242223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:55:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210529620] [2024-11-11 20:55:11,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:11,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:55:11,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:11,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:55:11,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:55:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:55:11,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:55:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:11,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:55:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 20:55:12,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210529620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:55:12,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:55:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2024-11-11 20:55:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773668213] [2024-11-11 20:55:12,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:55:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:55:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:55:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:12,050 INFO L87 Difference]: Start difference. First operand 260 states and 318 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:55:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:12,585 INFO L93 Difference]: Finished difference Result 599 states and 768 transitions. [2024-11-11 20:55:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 20:55:12,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2024-11-11 20:55:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:12,588 INFO L225 Difference]: With dead ends: 599 [2024-11-11 20:55:12,589 INFO L226 Difference]: Without dead ends: 386 [2024-11-11 20:55:12,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 183 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:55:12,594 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 351 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:12,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 398 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:55:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-11 20:55:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 355. [2024-11-11 20:55:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 276 states have (on average 1.210144927536232) internal successors, (334), 295 states have internal predecessors, (334), 38 states have call successors, (38), 36 states have call predecessors, (38), 40 states have return successors, (65), 36 states have call predecessors, (65), 38 states have call successors, (65) [2024-11-11 20:55:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 437 transitions. [2024-11-11 20:55:12,622 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 437 transitions. Word has length 86 [2024-11-11 20:55:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:12,624 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 437 transitions. [2024-11-11 20:55:12,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:55:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 437 transitions. [2024-11-11 20:55:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:55:12,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:12,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:12,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:55:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 20:55:12,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1210307397, now seen corresponding path program 2 times [2024-11-11 20:55:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976661480] [2024-11-11 20:55:12,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:55:12,852 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 20:55:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:55:12,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 20:55:12,899 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 20:55:12,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:55:12,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:55:12,906 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:13,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:55:13,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:55:13 BoogieIcfgContainer [2024-11-11 20:55:13,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:55:13,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:55:13,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:55:13,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:55:13,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:07" (3/4) ... [2024-11-11 20:55:13,011 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 20:55:13,101 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:55:13,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:55:13,102 INFO L158 Benchmark]: Toolchain (without parser) took 6286.61ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 125.8MB in the beginning and 89.5MB in the end (delta: 36.3MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,102 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:55:13,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.04ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 148.2MB in the end (delta: -22.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,103 INFO L158 Benchmark]: Boogie Preprocessor took 55.07ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 143.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,103 INFO L158 Benchmark]: RCFGBuilder took 425.31ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 125.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,104 INFO L158 Benchmark]: TraceAbstraction took 5113.13ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 124.7MB in the beginning and 98.9MB in the end (delta: 25.8MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,105 INFO L158 Benchmark]: Witness Printer took 92.06ms. Allocated memory is still 222.3MB. Free memory was 97.9MB in the beginning and 89.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:55:13,106 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.20ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.04ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 148.2MB in the end (delta: -22.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 146.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.07ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 143.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.31ms. Allocated memory is still 184.5MB. Free memory was 143.6MB in the beginning and 125.1MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5113.13ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 124.7MB in the beginning and 98.9MB in the end (delta: 25.8MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 92.06ms. Allocated memory is still 222.3MB. Free memory was 97.9MB in the beginning and 89.5MB in the end (delta: 8.4MB). 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: 118]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] - GenericResultAtLocation [Line: 322]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [322] - GenericResultAtLocation [Line: 331]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [331] - GenericResultAtLocation [Line: 697]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [697] - GenericResultAtLocation [Line: 724]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [724] - GenericResultAtLocation [Line: 823]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [823] - GenericResultAtLocation [Line: 917]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [917] * 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 - CounterExampleResult [Line: 327]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L127] int pumpRunning = 0; [L128] int systemActive = 1; [L501] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L725] int cleanupTimeShifts = 4; [L824] int waterLevel = 1; [L825] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L801] int retValue_acc ; [L802] int tmp ; [L806] FCALL select_helpers() [L807] FCALL select_features() [L808] CALL, EXPR valid_product() [L944] int retValue_acc ; [L947] retValue_acc = 1 [L948] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L808] RET, EXPR valid_product() [L808] tmp = valid_product() [L810] COND TRUE \read(tmp) [L812] FCALL setup() [L813] CALL runTest() [L792] CALL test() [L55] int splverifierCounter ; [L56] int tmp ; [L57] int tmp___0 ; [L58] int tmp___1 ; [L59] int tmp___2 ; [L62] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L64] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L66] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L72] tmp = __VERIFIER_nondet_int() [L74] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L76] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] COND TRUE waterLevel < 2 [L843] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L76] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L82] tmp___0 = __VERIFIER_nondet_int() [L84] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L92] tmp___2 = __VERIFIER_nondet_int() [L94] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L107] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L135] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L142] COND TRUE \read(systemActive) [L144] CALL processEnvironment() [L190] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L193] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L208] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L164] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L167] COND TRUE ! pumpRunning [L169] CALL, EXPR isHighWaterLevel() [L304] int retValue_acc ; [L305] int tmp ; [L306] int tmp___0 ; [L310] CALL, EXPR isHighWaterSensorDry() [L904] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L907] COND FALSE !(waterLevel < 2) [L911] retValue_acc = 0 [L912] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L310] RET, EXPR isHighWaterSensorDry() [L310] tmp = isHighWaterSensorDry() [L312] COND FALSE !(\read(tmp)) [L315] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L317] retValue_acc = tmp___0 [L318] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L169] RET, EXPR isHighWaterLevel() [L169] tmp = isHighWaterLevel() [L171] COND TRUE \read(tmp) [L173] CALL activatePump() [L223] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L227] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L248] int retValue_acc ; [L252] CALL, EXPR isMethaneLevelCritical() [L863] int retValue_acc ; [L866] retValue_acc = methaneLevelCritical [L867] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L252] RET, EXPR isMethaneLevelCritical() [L252] retValue_acc = isMethaneLevelCritical() [L254] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L227] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L227] tmp = isMethaneAlarm() [L229] COND FALSE !(\read(tmp)) [L233] CALL activatePump__wrappee__highWaterSensor() [L218] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L233] RET activatePump__wrappee__highWaterSensor() [L173] RET activatePump() [L208] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L144] RET processEnvironment() [L150] CALL __utac_acc__Specification4_spec__1() [L700] int tmp ; [L701] int tmp___0 ; [L705] CALL, EXPR getWaterLevel() [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L705] RET, EXPR getWaterLevel() [L705] tmp = getWaterLevel() [L707] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L150] RET __utac_acc__Specification4_spec__1() [L107] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L64] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L66] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L72] tmp = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L82] tmp___0 = __VERIFIER_nondet_int() [L84] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L92] tmp___2 = __VERIFIER_nondet_int() [L94] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L107] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L135] COND TRUE \read(pumpRunning) [L137] CALL lowerWaterLevel() [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L137] RET lowerWaterLevel() [L142] COND TRUE \read(systemActive) [L144] CALL processEnvironment() [L190] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L193] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L195] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L248] int retValue_acc ; [L252] CALL, EXPR isMethaneLevelCritical() [L863] int retValue_acc ; [L866] retValue_acc = methaneLevelCritical [L867] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L252] RET, EXPR isMethaneLevelCritical() [L252] retValue_acc = isMethaneLevelCritical() [L254] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L195] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L195] tmp = isMethaneAlarm() [L197] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L203] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L164] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L167] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L182] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L203] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L144] RET processEnvironment() [L150] CALL __utac_acc__Specification4_spec__1() [L700] int tmp ; [L701] int tmp___0 ; [L705] CALL, EXPR getWaterLevel() [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L705] RET, EXPR getWaterLevel() [L705] tmp = getWaterLevel() [L707] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L150] RET __utac_acc__Specification4_spec__1() [L107] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L64] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L66] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L72] tmp = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L82] tmp___0 = __VERIFIER_nondet_int() [L84] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L92] tmp___2 = __VERIFIER_nondet_int() [L94] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L107] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L135] COND TRUE \read(pumpRunning) [L137] CALL lowerWaterLevel() [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L137] RET lowerWaterLevel() [L142] COND TRUE \read(systemActive) [L144] CALL processEnvironment() [L190] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L193] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L195] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L248] int retValue_acc ; [L252] CALL, EXPR isMethaneLevelCritical() [L863] int retValue_acc ; [L866] retValue_acc = methaneLevelCritical [L867] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L252] RET, EXPR isMethaneLevelCritical() [L252] retValue_acc = isMethaneLevelCritical() [L254] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L195] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L195] tmp = isMethaneAlarm() [L197] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L203] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L164] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L167] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L182] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L203] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L144] RET processEnvironment() [L150] CALL __utac_acc__Specification4_spec__1() [L700] int tmp ; [L701] int tmp___0 ; [L705] CALL, EXPR getWaterLevel() [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L705] RET, EXPR getWaterLevel() [L705] tmp = getWaterLevel() [L707] COND TRUE tmp == 0 [L709] CALL, EXPR isPumpRunning() [L259] int retValue_acc ; [L262] retValue_acc = pumpRunning [L263] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L709] RET, EXPR isPumpRunning() [L709] tmp___0 = isPumpRunning() [L711] COND TRUE \read(tmp___0) [L713] CALL __automaton_fail() [L327] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1463 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1438 mSDsluCounter, 2399 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1654 mSDsCounter, 310 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1574 IncrementalHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 310 mSolverCounterUnsat, 745 mSDtfsCounter, 1574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 236 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=10, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 1102 SizeOfPredicates, 2 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 49/72 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-11 20:55:13,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE