./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product38.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 dfe9857e69a888cdbad1416d1b07f69e8062222f8bcfc0bd9dc9f4a773a0fc6f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:15:51,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:15:51,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:15:51,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:15:51,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:15:51,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:15:51,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:15:51,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:15:51,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:15:51,366 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:15:51,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:15:51,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:15:51,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:15:51,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:15:51,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:15:51,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:15:51,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:15:51,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:15:51,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:15:51,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:15:51,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:15:51,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:15:51,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:15:51,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:15:51,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:15:51,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:15:51,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:15:51,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:15:51,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:15:51,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:15:51,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:15:51,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:15:51,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:15:51,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:15:51,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:15:51,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:15:51,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:15:51,376 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 -> dfe9857e69a888cdbad1416d1b07f69e8062222f8bcfc0bd9dc9f4a773a0fc6f [2024-11-08 15:15:51,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:15:51,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:15:51,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:15:51,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:15:51,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:15:51,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2024-11-08 15:15:53,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:15:53,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:15:53,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2024-11-08 15:15:53,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b17510d/c57162879eb9488dabb61247a611f5bc/FLAG784359ad4 [2024-11-08 15:15:53,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0b17510d/c57162879eb9488dabb61247a611f5bc [2024-11-08 15:15:53,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:15:53,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:15:53,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:15:53,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:15:53,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:15:53,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fa18b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53, skipping insertion in model container [2024-11-08 15:15:53,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:15:53,544 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_product38.cil.c[4301,4314] [2024-11-08 15:15:53,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:15:53,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:15:53,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-11-08 15:15:53,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] [2024-11-08 15:15:53,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [252] [2024-11-08 15:15:53,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [261] [2024-11-08 15:15:53,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [288] [2024-11-08 15:15:53,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [356] [2024-11-08 15:15:53,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] [2024-11-08 15:15:53,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] [2024-11-08 15:15:53,686 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_product38.cil.c[4301,4314] [2024-11-08 15:15:53,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:15:53,739 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:15:53,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53 WrapperNode [2024-11-08 15:15:53,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:15:53,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:15:53,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:15:53,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:15:53,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,777 INFO L138 Inliner]: procedures = 54, calls = 98, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 201 [2024-11-08 15:15:53,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:15:53,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:15:53,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:15:53,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:15:53,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:15:53,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:15:53,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:15:53,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:15:53,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:15:53,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (1/1) ... [2024-11-08 15:15:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:15:53,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:15:53,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:15:53,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:15:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:15:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:15:53,882 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:15:53,882 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:15:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:15:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:15:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:15:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:15:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-08 15:15:53,883 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:15:53,883 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:15:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:15:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:15:53,884 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:15:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:15:53,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:15:53,950 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:15:53,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:15:54,183 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-08 15:15:54,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:15:54,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:15:54,199 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:15:54,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:54 BoogieIcfgContainer [2024-11-08 15:15:54,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:15:54,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:15:54,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:15:54,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:15:54,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:15:53" (1/3) ... [2024-11-08 15:15:54,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6266b283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:15:54, skipping insertion in model container [2024-11-08 15:15:54,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:53" (2/3) ... [2024-11-08 15:15:54,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6266b283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:15:54, skipping insertion in model container [2024-11-08 15:15:54,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:54" (3/3) ... [2024-11-08 15:15:54,209 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38.cil.c [2024-11-08 15:15:54,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:15:54,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:15:54,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:15:54,284 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;@51d44e1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:15:54,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:15:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 71 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 15:15:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 15:15:54,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:54,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:54,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:54,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 625198948, now seen corresponding path program 1 times [2024-11-08 15:15:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421366324] [2024-11-08 15:15:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:54,448 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-08 15:15:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421366324] [2024-11-08 15:15:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421366324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:15:54,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052792424] [2024-11-08 15:15:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:15:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:15:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:15:54,476 INFO L87 Difference]: Start difference. First operand has 81 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 71 states have internal predecessors, (88), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) 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-08 15:15:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:54,506 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2024-11-08 15:15:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:15:54,508 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-08 15:15:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:54,514 INFO L225 Difference]: With dead ends: 154 [2024-11-08 15:15:54,514 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 15:15:54,517 INFO L431 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-08 15:15:54,522 INFO L432 NwaCegarLoop]: 102 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, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:54,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 15:15:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 15:15:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:15:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2024-11-08 15:15:54,586 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 19 [2024-11-08 15:15:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:54,587 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-11-08 15:15:54,587 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-08 15:15:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2024-11-08 15:15:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 15:15:54,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:54,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:54,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:15:54,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:54,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1683328877, now seen corresponding path program 1 times [2024-11-08 15:15:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:54,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982948316] [2024-11-08 15:15:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:54,705 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-08 15:15:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:54,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982948316] [2024-11-08 15:15:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982948316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:54,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:15:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698858558] [2024-11-08 15:15:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:54,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:15:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:15:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:54,708 INFO L87 Difference]: Start difference. First operand 72 states and 93 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-08 15:15:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:54,718 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2024-11-08 15:15:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:15:54,719 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-08 15:15:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:54,720 INFO L225 Difference]: With dead ends: 109 [2024-11-08 15:15:54,720 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 15:15:54,720 INFO L431 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-08 15:15:54,721 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:54,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 15:15:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 15:15:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.34) internal successors, (67), 57 states have internal predecessors, (67), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:15:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-08 15:15:54,727 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 20 [2024-11-08 15:15:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:54,727 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-08 15:15:54,727 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-08 15:15:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-08 15:15:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:15:54,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:54,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:54,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:15:54,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:54,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2134350803, now seen corresponding path program 1 times [2024-11-08 15:15:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:54,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170222] [2024-11-08 15:15:54,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:54,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:54,825 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-08 15:15:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170222] [2024-11-08 15:15:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:54,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80577886] [2024-11-08 15:15:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:54,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:54,827 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-08 15:15:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:54,864 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-08 15:15:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:15:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 25 [2024-11-08 15:15:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:54,866 INFO L225 Difference]: With dead ends: 119 [2024-11-08 15:15:54,866 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 15:15:54,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:54,867 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 15:15:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 15:15:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.32) internal successors, (66), 57 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:15:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-08 15:15:54,873 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 25 [2024-11-08 15:15:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:54,874 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-08 15:15:54,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-08 15:15:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-08 15:15:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 15:15:54,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:54,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:15:54,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1403273820, now seen corresponding path program 1 times [2024-11-08 15:15:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732318657] [2024-11-08 15:15:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:54,935 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-08 15:15:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732318657] [2024-11-08 15:15:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732318657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:54,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:15:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831068023] [2024-11-08 15:15:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:15:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:15:54,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:54,936 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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-08 15:15:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:54,960 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2024-11-08 15:15:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:15:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 31 [2024-11-08 15:15:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:54,962 INFO L225 Difference]: With dead ends: 158 [2024-11-08 15:15:54,962 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 15:15:54,962 INFO L431 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-08 15:15:54,963 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:54,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 15:15:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-08 15:15:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 86 states have internal predecessors, (103), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-08 15:15:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2024-11-08 15:15:54,974 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 31 [2024-11-08 15:15:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:54,974 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2024-11-08 15:15:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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-08 15:15:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2024-11-08 15:15:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:15:54,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:54,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:15:54,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:54,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -52079251, now seen corresponding path program 1 times [2024-11-08 15:15:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053320955] [2024-11-08 15:15:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,059 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-08 15:15:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053320955] [2024-11-08 15:15:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053320955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:55,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:55,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409320742] [2024-11-08 15:15:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:55,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:55,062 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:55,169 INFO L93 Difference]: Finished difference Result 217 states and 283 transitions. [2024-11-08 15:15:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:15:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:15:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:55,170 INFO L225 Difference]: With dead ends: 217 [2024-11-08 15:15:55,170 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 15:15:55,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:55,172 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:55,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 248 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 15:15:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-08 15:15:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 105 states have internal predecessors, (126), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-08 15:15:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-08 15:15:55,184 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 39 [2024-11-08 15:15:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:55,185 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-08 15:15:55,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-08 15:15:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:15:55,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:55,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:55,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:15:55,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:55,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:55,187 INFO L85 PathProgramCache]: Analyzing trace with hash 959037999, now seen corresponding path program 1 times [2024-11-08 15:15:55,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:55,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106221458] [2024-11-08 15:15:55,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:55,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,285 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-08 15:15:55,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106221458] [2024-11-08 15:15:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106221458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:55,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:55,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:15:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935591179] [2024-11-08 15:15:55,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:55,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:15:55,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:15:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:15:55,287 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:55,392 INFO L93 Difference]: Finished difference Result 242 states and 308 transitions. [2024-11-08 15:15:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:15:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:15:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:55,393 INFO L225 Difference]: With dead ends: 242 [2024-11-08 15:15:55,394 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 15:15:55,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:15:55,395 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:55,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 316 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 15:15:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-08 15:15:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 108 states have internal predecessors, (129), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-08 15:15:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 156 transitions. [2024-11-08 15:15:55,417 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 156 transitions. Word has length 39 [2024-11-08 15:15:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 156 transitions. [2024-11-08 15:15:55,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2024-11-08 15:15:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:15:55,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:55,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:55,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:15:55,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1073147605, now seen corresponding path program 1 times [2024-11-08 15:15:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222349982] [2024-11-08 15:15:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,492 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-08 15:15:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:55,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222349982] [2024-11-08 15:15:55,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222349982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:55,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:55,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134194185] [2024-11-08 15:15:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:55,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:55,495 INFO L87 Difference]: Start difference. First operand 125 states and 156 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:55,628 INFO L93 Difference]: Finished difference Result 358 states and 469 transitions. [2024-11-08 15:15:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:15:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:15:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:55,631 INFO L225 Difference]: With dead ends: 358 [2024-11-08 15:15:55,631 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 15:15:55,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:55,633 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 178 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:55,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 257 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 15:15:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2024-11-08 15:15:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 195 states have internal predecessors, (232), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2024-11-08 15:15:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 297 transitions. [2024-11-08 15:15:55,666 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 297 transitions. Word has length 39 [2024-11-08 15:15:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:55,667 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 297 transitions. [2024-11-08 15:15:55,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 297 transitions. [2024-11-08 15:15:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 15:15:55,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:55,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:15:55,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1624794265, now seen corresponding path program 1 times [2024-11-08 15:15:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89451880] [2024-11-08 15:15:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:15:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,727 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-08 15:15:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89451880] [2024-11-08 15:15:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89451880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:55,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:15:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700177352] [2024-11-08 15:15:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:55,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:15:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:15:55,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:15:55,729 INFO L87 Difference]: Start difference. First operand 232 states and 297 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-08 15:15:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:55,840 INFO L93 Difference]: Finished difference Result 457 states and 586 transitions. [2024-11-08 15:15:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:15:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 41 [2024-11-08 15:15:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:55,843 INFO L225 Difference]: With dead ends: 457 [2024-11-08 15:15:55,843 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 15:15:55,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:15:55,844 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:55,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 277 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 15:15:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-08 15:15:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 193 states have internal predecessors, (228), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (42), 23 states have call predecessors, (42), 23 states have call successors, (42) [2024-11-08 15:15:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 293 transitions. [2024-11-08 15:15:55,859 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 293 transitions. Word has length 41 [2024-11-08 15:15:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:55,859 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 293 transitions. [2024-11-08 15:15:55,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-08 15:15:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 293 transitions. [2024-11-08 15:15:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:15:55,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:55,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:55,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:15:55,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2088252347, now seen corresponding path program 1 times [2024-11-08 15:15:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:55,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995063400] [2024-11-08 15:15:55,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:55,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:15:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:55,935 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-08 15:15:55,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:55,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995063400] [2024-11-08 15:15:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995063400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:55,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:15:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46135160] [2024-11-08 15:15:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:55,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:15:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:15:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:55,937 INFO L87 Difference]: Start difference. First operand 230 states and 293 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:56,229 INFO L93 Difference]: Finished difference Result 484 states and 635 transitions. [2024-11-08 15:15:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:15:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-08 15:15:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:56,231 INFO L225 Difference]: With dead ends: 484 [2024-11-08 15:15:56,231 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 15:15:56,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:15:56,233 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 152 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:56,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 460 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:15:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 15:15:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 269. [2024-11-08 15:15:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 214 states have (on average 1.2242990654205608) internal successors, (262), 229 states have internal predecessors, (262), 25 states have call successors, (25), 23 states have call predecessors, (25), 29 states have return successors, (54), 27 states have call predecessors, (54), 25 states have call successors, (54) [2024-11-08 15:15:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 341 transitions. [2024-11-08 15:15:56,254 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 341 transitions. Word has length 43 [2024-11-08 15:15:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:56,254 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 341 transitions. [2024-11-08 15:15:56,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 341 transitions. [2024-11-08 15:15:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 15:15:56,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:56,256 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:15:56,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:15:56,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:56,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1302969568, now seen corresponding path program 1 times [2024-11-08 15:15:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:56,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757504162] [2024-11-08 15:15:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:15:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:15:56,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757504162] [2024-11-08 15:15:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757504162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:15:56,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890175458] [2024-11-08 15:15:56,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:56,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:15:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:15:56,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:15:56,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:15:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:56,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:15:56,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:15:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:56,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:15:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890175458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:15:56,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:15:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-08 15:15:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007179744] [2024-11-08 15:15:56,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:15:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:15:56,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:15:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:15:56,624 INFO L87 Difference]: Start difference. First operand 269 states and 341 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:15:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:57,384 INFO L93 Difference]: Finished difference Result 631 states and 850 transitions. [2024-11-08 15:15:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-08 15:15:57,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-11-08 15:15:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:57,387 INFO L225 Difference]: With dead ends: 631 [2024-11-08 15:15:57,387 INFO L226 Difference]: Without dead ends: 412 [2024-11-08 15:15:57,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=408, Invalid=2042, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 15:15:57,389 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 514 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:57,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 677 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:15:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-08 15:15:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 363. [2024-11-08 15:15:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.2167832167832169) internal successors, (348), 307 states have internal predecessors, (348), 36 states have call successors, (36), 33 states have call predecessors, (36), 40 states have return successors, (82), 36 states have call predecessors, (82), 36 states have call successors, (82) [2024-11-08 15:15:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 466 transitions. [2024-11-08 15:15:57,411 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 466 transitions. Word has length 69 [2024-11-08 15:15:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:57,411 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 466 transitions. [2024-11-08 15:15:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 9 states have internal predecessors, (94), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:15:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 466 transitions. [2024-11-08 15:15:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 15:15:57,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:57,413 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:57,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:15:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:15:57,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -405247387, now seen corresponding path program 1 times [2024-11-08 15:15:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774480822] [2024-11-08 15:15:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:15:57,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:15:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:15:57,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:15:57,660 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:15:57,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:15:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:15:57,664 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:57,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:15:57,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:15:57 BoogieIcfgContainer [2024-11-08 15:15:57,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:15:57,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:15:57,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:15:57,713 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:15:57,713 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:54" (3/4) ... [2024-11-08 15:15:57,714 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:15:57,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:15:57,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:15:57,772 INFO L158 Benchmark]: Toolchain (without parser) took 4480.55ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 102.0MB in the beginning and 83.2MB in the end (delta: 18.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,772 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:15:57,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.31ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 102.0MB in the beginning and 212.8MB in the end (delta: -110.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.58ms. Allocated memory is still 247.5MB. Free memory was 212.8MB in the beginning and 209.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,773 INFO L158 Benchmark]: Boogie Preprocessor took 31.07ms. Allocated memory is still 247.5MB. Free memory was 209.6MB in the beginning and 207.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,773 INFO L158 Benchmark]: RCFGBuilder took 390.51ms. Allocated memory is still 247.5MB. Free memory was 207.5MB in the beginning and 188.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,773 INFO L158 Benchmark]: TraceAbstraction took 3510.70ms. Allocated memory is still 247.5MB. Free memory was 188.7MB in the beginning and 90.6MB in the end (delta: 98.1MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,773 INFO L158 Benchmark]: Witness Printer took 58.91ms. Allocated memory is still 247.5MB. Free memory was 90.6MB in the beginning and 83.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:15:57,774 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.11ms. Allocated memory is still 176.2MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.31ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 102.0MB in the beginning and 212.8MB in the end (delta: -110.8MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.58ms. Allocated memory is still 247.5MB. Free memory was 212.8MB in the beginning and 209.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.07ms. Allocated memory is still 247.5MB. Free memory was 209.6MB in the beginning and 207.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.51ms. Allocated memory is still 247.5MB. Free memory was 207.5MB in the beginning and 188.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3510.70ms. Allocated memory is still 247.5MB. Free memory was 188.7MB in the beginning and 90.6MB in the end (delta: 98.1MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. * Witness Printer took 58.91ms. Allocated memory is still 247.5MB. Free memory was 90.6MB in the beginning and 83.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] - GenericResultAtLocation [Line: 252]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [252] - GenericResultAtLocation [Line: 261]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [261] - GenericResultAtLocation [Line: 288]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [288] - GenericResultAtLocation [Line: 356]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [356] - GenericResultAtLocation [Line: 544]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] - GenericResultAtLocation [Line: 910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] * 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: 257]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L50] int cleanupTimeShifts = 4; [L159] int waterLevel = 1; [L160] int methaneLevelCritical = 0; [L359] int pumpRunning = 0; [L360] int systemActive = 1; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L131] int retValue_acc ; [L132] int tmp ; [L136] FCALL select_helpers() [L137] FCALL select_features() [L138] CALL, EXPR valid_product() [L937] int retValue_acc ; [L940] retValue_acc = 1 [L941] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L138] RET, EXPR valid_product() [L138] tmp = valid_product() [L140] COND TRUE \read(tmp) [L142] FCALL setup() [L143] CALL runTest() [L122] CALL test() [L291] int splverifierCounter ; [L292] int tmp ; [L293] int tmp___0 ; [L294] int tmp___1 ; [L295] int tmp___2 ; [L298] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L302] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L308] tmp = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L312] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L177] COND TRUE waterLevel < 2 [L178] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L366] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L424] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L395] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L398] COND TRUE ! pumpRunning [L400] CALL, EXPR isHighWaterLevel() [L518] int retValue_acc ; [L519] int tmp ; [L520] int tmp___0 ; [L524] CALL, EXPR isHighWaterSensorDry() [L239] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] COND FALSE !(waterLevel < 2) [L246] retValue_acc = 0 [L247] 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] [L524] RET, EXPR isHighWaterSensorDry() [L524] tmp = isHighWaterSensorDry() [L526] COND FALSE !(\read(tmp)) [L529] 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] [L531] retValue_acc = tmp___0 [L532] 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] [L400] RET, EXPR isHighWaterLevel() [L400] tmp = isHighWaterLevel() [L402] COND TRUE \read(tmp) [L404] CALL activatePump() [L449] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L404] RET activatePump() [L439] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] 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] [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L381] RET __utac_acc__Specification4_spec__1() [L345] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L302] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L308] tmp = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L366] COND TRUE \read(pumpRunning) [L368] CALL lowerWaterLevel() [L165] COND TRUE waterLevel > 0 [L166] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L368] RET lowerWaterLevel() [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L424] COND TRUE \read(pumpRunning) [L426] CALL, EXPR isMethaneAlarm() [L462] int retValue_acc ; [L466] CALL, EXPR isMethaneLevelCritical() [L198] int retValue_acc ; [L201] retValue_acc = methaneLevelCritical [L202] 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] [L466] RET, EXPR isMethaneLevelCritical() [L466] retValue_acc = isMethaneLevelCritical() [L468] 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] [L426] RET, EXPR isMethaneAlarm() [L426] tmp = isMethaneAlarm() [L428] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L434] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L395] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L398] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L413] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L434] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] 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] [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L381] RET __utac_acc__Specification4_spec__1() [L345] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L302] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L308] tmp = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L366] COND TRUE \read(pumpRunning) [L368] CALL lowerWaterLevel() [L165] COND TRUE waterLevel > 0 [L166] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L368] RET lowerWaterLevel() [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L424] COND TRUE \read(pumpRunning) [L426] CALL, EXPR isMethaneAlarm() [L462] int retValue_acc ; [L466] CALL, EXPR isMethaneLevelCritical() [L198] int retValue_acc ; [L201] retValue_acc = methaneLevelCritical [L202] 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] [L466] RET, EXPR isMethaneLevelCritical() [L466] retValue_acc = isMethaneLevelCritical() [L468] 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] [L426] RET, EXPR isMethaneAlarm() [L426] tmp = isMethaneAlarm() [L428] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L434] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L395] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L398] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L413] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L434] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] 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] [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND TRUE tmp == 0 [L273] CALL, EXPR isPumpRunning() [L473] int retValue_acc ; [L476] retValue_acc = pumpRunning [L477] 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] [L273] RET, EXPR isPumpRunning() [L273] tmp___0 = isPumpRunning() [L275] COND TRUE \read(tmp___0) [L277] CALL __automaton_fail() [L257] 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 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1175 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 2852 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2002 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1460 IncrementalHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 850 mSDtfsCounter, 1460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=363occurred in iteration=10, InterpolantAutomatonStates: 100, 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, 98 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 875 SizeOfPredicates, 2 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 42/51 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-08 15:15:57,802 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