./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.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 cb82edc0720115a7daf634e8ab19e02bd974ec3bbe9487e9c9b9a9d3ab6ca10d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:41:50,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:41:50,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:41:50,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:41:50,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:41:51,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:41:51,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:41:51,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:41:51,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:41:51,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:41:51,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:41:51,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:41:51,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:41:51,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:41:51,015 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:41:51,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:41:51,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:41:51,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:41:51,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:41:51,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:41:51,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:41:51,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:41:51,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:41:51,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:41:51,018 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:41:51,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:41:51,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:41:51,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:41:51,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:41:51,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:41:51,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:41:51,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:41:51,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:51,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:41:51,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:41:51,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:41:51,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:41:51,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:41:51,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:41:51,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:41:51,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:41:51,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:41:51,023 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 -> cb82edc0720115a7daf634e8ab19e02bd974ec3bbe9487e9c9b9a9d3ab6ca10d [2024-10-12 19:41:51,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:41:51,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:41:51,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:41:51,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:41:51,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:41:51,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c [2024-10-12 19:41:52,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:41:53,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:41:53,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c [2024-10-12 19:41:53,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a58fe4a9/b98a9869d8524d28a7171c975ef70ae8/FLAGb98f63d3e [2024-10-12 19:41:53,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a58fe4a9/b98a9869d8524d28a7171c975ef70ae8 [2024-10-12 19:41:53,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:41:53,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:41:53,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:53,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:41:53,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:41:53,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180ecc0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53, skipping insertion in model container [2024-10-12 19:41:53,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:41:53,450 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c[6627,6640] [2024-10-12 19:41:53,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:53,525 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:41:53,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-10-12 19:41:53,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-10-12 19:41:53,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [308] [2024-10-12 19:41:53,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [407] [2024-10-12 19:41:53,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [442] [2024-10-12 19:41:53,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [451] [2024-10-12 19:41:53,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [817] [2024-10-12 19:41:53,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [912] [2024-10-12 19:41:53,555 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c[6627,6640] [2024-10-12 19:41:53,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:53,631 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:41:53,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53 WrapperNode [2024-10-12 19:41:53,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:53,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:53,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:41:53,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:41:53,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,692 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 24, calls inlined = 20, statements flattened = 180 [2024-10-12 19:41:53,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:53,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:41:53,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:41:53,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:41:53,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:41:53,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:41:53,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:41:53,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:41:53,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:41:53,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (1/1) ... [2024-10-12 19:41:53,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:53,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:41:53,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:41:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:41:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:41:53,826 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:41:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:41:53,826 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:41:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:41:53,826 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:41:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:41:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:41:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:41:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:41:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:41:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:41:53,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:41:53,897 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:41:53,899 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:41:54,097 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-12 19:41:54,097 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:41:54,180 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:41:54,181 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:41:54,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:54 BoogieIcfgContainer [2024-10-12 19:41:54,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:41:54,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:41:54,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:41:54,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:41:54,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:41:53" (1/3) ... [2024-10-12 19:41:54,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126f251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:54, skipping insertion in model container [2024-10-12 19:41:54,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:53" (2/3) ... [2024-10-12 19:41:54,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126f251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:54, skipping insertion in model container [2024-10-12 19:41:54,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:54" (3/3) ... [2024-10-12 19:41:54,189 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product36.cil.c [2024-10-12 19:41:54,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:41:54,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:41:54,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:41:54,268 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;@62cb0c11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:41:54,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:41:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 47 states have internal predecessors, (65), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:41:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 19:41:54,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:54,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:54,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1443478454, now seen corresponding path program 1 times [2024-10-12 19:41:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208921609] [2024-10-12 19:41:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:54,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208921609] [2024-10-12 19:41:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208921609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:54,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:54,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:41:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029572357] [2024-10-12 19:41:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:54,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:41:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:41:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:41:54,497 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 47 states have internal predecessors, (65), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-12 19:41:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:54,565 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2024-10-12 19:41:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:41:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2024-10-12 19:41:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:54,586 INFO L225 Difference]: With dead ends: 110 [2024-10-12 19:41:54,586 INFO L226 Difference]: Without dead ends: 51 [2024-10-12 19:41:54,591 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-10-12 19:41:54,599 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:54,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-12 19:41:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-12 19:41:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 43 states have internal predecessors, (55), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:41:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-10-12 19:41:54,646 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 12 [2024-10-12 19:41:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:54,648 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-10-12 19:41:54,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-12 19:41:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-10-12 19:41:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 19:41:54,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:54,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:54,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:41:54,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:54,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -42889809, now seen corresponding path program 1 times [2024-10-12 19:41:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793992918] [2024-10-12 19:41:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:54,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:54,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793992918] [2024-10-12 19:41:54,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793992918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:54,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279465338] [2024-10-12 19:41:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:54,813 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 19:41:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:54,862 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2024-10-12 19:41:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-10-12 19:41:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:54,864 INFO L225 Difference]: With dead ends: 73 [2024-10-12 19:41:54,864 INFO L226 Difference]: Without dead ends: 43 [2024-10-12 19:41:54,865 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-10-12 19:41:54,866 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-12 19:41:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-12 19:41:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 19:41:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-10-12 19:41:54,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 13 [2024-10-12 19:41:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:54,881 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-10-12 19:41:54,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 19:41:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-10-12 19:41:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:41:54,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:54,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:54,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:41:54,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:54,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1656473934, now seen corresponding path program 1 times [2024-10-12 19:41:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639451282] [2024-10-12 19:41:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639451282] [2024-10-12 19:41:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639451282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:55,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30209355] [2024-10-12 19:41:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:55,020 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-12 19:41:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:55,091 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2024-10-12 19:41:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-10-12 19:41:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:55,096 INFO L225 Difference]: With dead ends: 125 [2024-10-12 19:41:55,096 INFO L226 Difference]: Without dead ends: 84 [2024-10-12 19:41:55,097 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-10-12 19:41:55,098 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 53 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:55,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 98 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-12 19:41:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-10-12 19:41:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 70 states have internal predecessors, (91), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 19:41:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2024-10-12 19:41:55,118 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 16 [2024-10-12 19:41:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:55,119 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2024-10-12 19:41:55,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-10-12 19:41:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2024-10-12 19:41:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 19:41:55,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:55,123 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-10-12 19:41:55,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:41:55,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1247979908, now seen corresponding path program 1 times [2024-10-12 19:41:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761194225] [2024-10-12 19:41:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761194225] [2024-10-12 19:41:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761194225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:55,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143952976] [2024-10-12 19:41:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:41:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:41:55,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:41:55,330 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-12 19:41:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:55,437 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2024-10-12 19:41:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:41:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2024-10-12 19:41:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:55,440 INFO L225 Difference]: With dead ends: 230 [2024-10-12 19:41:55,440 INFO L226 Difference]: Without dead ends: 152 [2024-10-12 19:41:55,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:55,443 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:55,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 126 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-12 19:41:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-12 19:41:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 132 states have internal predecessors, (169), 20 states have call successors, (20), 16 states have call predecessors, (20), 16 states have return successors, (26), 16 states have call predecessors, (26), 20 states have call successors, (26) [2024-10-12 19:41:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2024-10-12 19:41:55,468 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 19 [2024-10-12 19:41:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2024-10-12 19:41:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-10-12 19:41:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2024-10-12 19:41:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:41:55,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:55,471 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] [2024-10-12 19:41:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:41:55,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1039112191, now seen corresponding path program 1 times [2024-10-12 19:41:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547988230] [2024-10-12 19:41:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547988230] [2024-10-12 19:41:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547988230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382638827] [2024-10-12 19:41:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:55,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:41:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:41:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:41:55,602 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-10-12 19:41:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:55,709 INFO L93 Difference]: Finished difference Result 404 states and 593 transitions. [2024-10-12 19:41:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:41:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2024-10-12 19:41:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:55,713 INFO L225 Difference]: With dead ends: 404 [2024-10-12 19:41:55,714 INFO L226 Difference]: Without dead ends: 254 [2024-10-12 19:41:55,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:55,720 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:55,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-12 19:41:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-10-12 19:41:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 212 states have internal predecessors, (272), 30 states have call successors, (30), 30 states have call predecessors, (30), 30 states have return successors, (54), 30 states have call predecessors, (54), 30 states have call successors, (54) [2024-10-12 19:41:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 356 transitions. [2024-10-12 19:41:55,756 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 356 transitions. Word has length 21 [2024-10-12 19:41:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:55,756 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 356 transitions. [2024-10-12 19:41:55,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-10-12 19:41:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 356 transitions. [2024-10-12 19:41:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 19:41:55,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:55,761 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:41:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:41:55,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1008136435, now seen corresponding path program 1 times [2024-10-12 19:41:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521534793] [2024-10-12 19:41:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:55,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:41:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:41:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521534793] [2024-10-12 19:41:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521534793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190159344] [2024-10-12 19:41:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:55,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:55,880 INFO L87 Difference]: Start difference. First operand 254 states and 356 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:41:56,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:56,119 INFO L93 Difference]: Finished difference Result 477 states and 674 transitions. [2024-10-12 19:41:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:41:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-12 19:41:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:56,122 INFO L225 Difference]: With dead ends: 477 [2024-10-12 19:41:56,122 INFO L226 Difference]: Without dead ends: 225 [2024-10-12 19:41:56,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:41:56,124 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 65 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:56,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 224 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-12 19:41:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2024-10-12 19:41:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 187 states have internal predecessors, (226), 24 states have call successors, (24), 21 states have call predecessors, (24), 27 states have return successors, (44), 24 states have call predecessors, (44), 24 states have call successors, (44) [2024-10-12 19:41:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 294 transitions. [2024-10-12 19:41:56,169 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 294 transitions. Word has length 43 [2024-10-12 19:41:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:56,169 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 294 transitions. [2024-10-12 19:41:56,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:41:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 294 transitions. [2024-10-12 19:41:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 19:41:56,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:56,172 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:41:56,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:41:56,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:56,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:56,173 INFO L85 PathProgramCache]: Analyzing trace with hash 86812608, now seen corresponding path program 1 times [2024-10-12 19:41:56,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068954770] [2024-10-12 19:41:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:41:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:41:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 19:41:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:56,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068954770] [2024-10-12 19:41:56,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068954770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:56,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004466869] [2024-10-12 19:41:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:56,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:56,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:56,280 INFO L87 Difference]: Start difference. First operand 219 states and 294 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:56,421 INFO L93 Difference]: Finished difference Result 442 states and 599 transitions. [2024-10-12 19:41:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:56,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-10-12 19:41:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:56,423 INFO L225 Difference]: With dead ends: 442 [2024-10-12 19:41:56,423 INFO L226 Difference]: Without dead ends: 225 [2024-10-12 19:41:56,424 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-10-12 19:41:56,425 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:56,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 130 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-12 19:41:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-12 19:41:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 190 states have internal predecessors, (228), 24 states have call successors, (24), 21 states have call predecessors, (24), 27 states have return successors, (43), 24 states have call predecessors, (43), 24 states have call successors, (43) [2024-10-12 19:41:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 295 transitions. [2024-10-12 19:41:56,461 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 295 transitions. Word has length 44 [2024-10-12 19:41:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 295 transitions. [2024-10-12 19:41:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 295 transitions. [2024-10-12 19:41:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 19:41:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:56,463 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:41:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:41:56,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2120351420, now seen corresponding path program 1 times [2024-10-12 19:41:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680493689] [2024-10-12 19:41:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:41:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:41:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:56,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680493689] [2024-10-12 19:41:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680493689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:56,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:56,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:41:56,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237379258] [2024-10-12 19:41:56,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:56,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:41:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:41:56,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:41:56,588 INFO L87 Difference]: Start difference. First operand 223 states and 295 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:56,837 INFO L93 Difference]: Finished difference Result 576 states and 779 transitions. [2024-10-12 19:41:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:56,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-10-12 19:41:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:56,840 INFO L225 Difference]: With dead ends: 576 [2024-10-12 19:41:56,840 INFO L226 Difference]: Without dead ends: 355 [2024-10-12 19:41:56,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:41:56,842 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 145 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:56,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 168 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-12 19:41:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2024-10-12 19:41:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 270 states have (on average 1.3222222222222222) internal successors, (357), 294 states have internal predecessors, (357), 40 states have call successors, (40), 38 states have call predecessors, (40), 40 states have return successors, (65), 35 states have call predecessors, (65), 40 states have call successors, (65) [2024-10-12 19:41:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 462 transitions. [2024-10-12 19:41:56,877 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 462 transitions. Word has length 44 [2024-10-12 19:41:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:56,878 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 462 transitions. [2024-10-12 19:41:56,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:41:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 462 transitions. [2024-10-12 19:41:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:41:56,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:56,884 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 19:41:56,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:41:56,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash -507711062, now seen corresponding path program 1 times [2024-10-12 19:41:56,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:56,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160303459] [2024-10-12 19:41:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:41:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:57,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160303459] [2024-10-12 19:41:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160303459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:41:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48470042] [2024-10-12 19:41:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:41:57,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:57,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:41:57,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:41:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:41:57,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:41:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:57,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:41:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48470042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:41:57,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:41:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-10-12 19:41:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550338029] [2024-10-12 19:41:57,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:41:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:41:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:41:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:41:57,332 INFO L87 Difference]: Start difference. First operand 351 states and 462 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:57,646 INFO L93 Difference]: Finished difference Result 878 states and 1188 transitions. [2024-10-12 19:41:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:41:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2024-10-12 19:41:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:57,651 INFO L225 Difference]: With dead ends: 878 [2024-10-12 19:41:57,651 INFO L226 Difference]: Without dead ends: 529 [2024-10-12 19:41:57,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:41:57,653 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 180 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:57,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 224 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-10-12 19:41:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 473. [2024-10-12 19:41:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 365 states have (on average 1.3013698630136987) internal successors, (475), 395 states have internal predecessors, (475), 55 states have call successors, (55), 52 states have call predecessors, (55), 52 states have return successors, (85), 46 states have call predecessors, (85), 55 states have call successors, (85) [2024-10-12 19:41:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 615 transitions. [2024-10-12 19:41:57,706 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 615 transitions. Word has length 48 [2024-10-12 19:41:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:57,708 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 615 transitions. [2024-10-12 19:41:57,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:57,709 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 615 transitions. [2024-10-12 19:41:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:41:57,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:57,710 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 19:41:57,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:41:57,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:41:57,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:57,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1785471832, now seen corresponding path program 2 times [2024-10-12 19:41:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414795616] [2024-10-12 19:41:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:41:57,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:41:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:41:57,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:41:57,962 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:41:57,963 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:41:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:41:57,968 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:58,034 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:41:58,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:41:58 BoogieIcfgContainer [2024-10-12 19:41:58,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:41:58,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:41:58,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:41:58,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:41:58,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:54" (3/4) ... [2024-10-12 19:41:58,039 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:41:58,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:41:58,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:41:58,115 INFO L158 Benchmark]: Toolchain (without parser) took 5006.01ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 93.7MB in the beginning and 125.3MB in the end (delta: -31.5MB). Peak memory consumption was 270.1kB. Max. memory is 16.1GB. [2024-10-12 19:41:58,115 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:41:58,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.75ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 117.9MB in the end (delta: -24.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-12 19:41:58,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.58ms. Allocated memory is still 155.2MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:41:58,115 INFO L158 Benchmark]: Boogie Preprocessor took 49.92ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:41:58,116 INFO L158 Benchmark]: RCFGBuilder took 437.24ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 92.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:41:58,116 INFO L158 Benchmark]: TraceAbstraction took 3853.23ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.0MB in the beginning and 130.5MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:41:58,116 INFO L158 Benchmark]: Witness Printer took 77.14ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 125.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:41:58,121 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.75ms. Allocated memory is still 155.2MB. Free memory was 93.7MB in the beginning and 117.9MB in the end (delta: -24.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.58ms. Allocated memory is still 155.2MB. Free memory was 117.9MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.92ms. Allocated memory is still 155.2MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.24ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 92.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3853.23ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.0MB in the beginning and 130.5MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 77.14ms. Allocated memory is still 186.6MB. Free memory was 130.5MB in the beginning and 125.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 308]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [308] - GenericResultAtLocation [Line: 407]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [407] - GenericResultAtLocation [Line: 442]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [442] - GenericResultAtLocation [Line: 451]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [451] - GenericResultAtLocation [Line: 817]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [817] - GenericResultAtLocation [Line: 912]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [912] * 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: 447]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L133] int pumpRunning = 0; [L134] int systemActive = 1; [L309] int cleanupTimeShifts = 4; [L621] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L819] int waterLevel = 1; [L820] int methaneLevelCritical = 0; [L385] int retValue_acc ; [L386] int tmp ; [L390] FCALL select_helpers() [L391] FCALL select_features() [L392] CALL, EXPR valid_product() [L434] int retValue_acc ; [L437] retValue_acc = 1 [L438] return (retValue_acc); [L392] RET, EXPR valid_product() [L392] tmp = valid_product() [L394] COND TRUE \read(tmp) [L396] FCALL setup() [L397] CALL runTest() [L376] CALL test() [L57] int splverifierCounter ; [L58] int tmp ; [L59] int tmp___0 ; [L60] int tmp___1 ; [L61] int tmp___2 ; [L64] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L66] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L68] COND TRUE splverifierCounter < 4 [L74] tmp = __VERIFIER_nondet_int() [L76] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L78] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L837] COND TRUE waterLevel < 2 [L838] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L78] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L84] tmp___0 = __VERIFIER_nondet_int() [L86] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L94] tmp___2 = __VERIFIER_nondet_int() [L96] COND TRUE \read(tmp___2) [L98] CALL startSystem() [L304] systemActive = 1 [L98] RET startSystem() [L113] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L141] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L148] COND TRUE \read(systemActive) [L150] CALL processEnvironment() [L170] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND TRUE ! pumpRunning [L175] CALL, EXPR isHighWaterLevel() [L267] int retValue_acc ; [L268] int tmp ; [L269] int tmp___0 ; [L273] CALL, EXPR isHighWaterSensorDry() [L899] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L902] COND FALSE !(waterLevel < 2) [L906] retValue_acc = 0 [L907] 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] [L273] RET, EXPR isHighWaterSensorDry() [L273] tmp = isHighWaterSensorDry() [L275] COND FALSE !(\read(tmp)) [L278] 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] [L280] retValue_acc = tmp___0 [L281] return (retValue_acc); [L175] RET, EXPR isHighWaterLevel() [L175] tmp = isHighWaterLevel() [L177] COND TRUE \read(tmp) [L179] CALL activatePump() [L198] pumpRunning = 1 [L179] RET activatePump() [L150] RET processEnvironment() [L156] CALL __utac_acc__Specification4_spec__1() [L914] int tmp ; [L915] int tmp___0 ; [L919] CALL, EXPR getWaterLevel() [L890] int retValue_acc ; [L893] retValue_acc = waterLevel [L894] return (retValue_acc); [L919] RET, EXPR getWaterLevel() [L919] tmp = getWaterLevel() [L921] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L156] RET __utac_acc__Specification4_spec__1() [L113] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L66] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L68] COND TRUE splverifierCounter < 4 [L74] tmp = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L84] tmp___0 = __VERIFIER_nondet_int() [L86] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L94] tmp___2 = __VERIFIER_nondet_int() [L96] COND TRUE \read(tmp___2) [L98] CALL startSystem() [L304] systemActive = 1 [L98] RET startSystem() [L113] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L141] COND TRUE \read(pumpRunning) [L143] CALL lowerWaterLevel() [L825] COND TRUE waterLevel > 0 [L826] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L143] RET lowerWaterLevel() [L148] COND TRUE \read(systemActive) [L150] CALL processEnvironment() [L170] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L188] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L150] RET processEnvironment() [L156] CALL __utac_acc__Specification4_spec__1() [L914] int tmp ; [L915] int tmp___0 ; [L919] CALL, EXPR getWaterLevel() [L890] int retValue_acc ; [L893] retValue_acc = waterLevel [L894] return (retValue_acc); [L919] RET, EXPR getWaterLevel() [L919] tmp = getWaterLevel() [L921] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L156] RET __utac_acc__Specification4_spec__1() [L113] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L66] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L68] COND TRUE splverifierCounter < 4 [L74] tmp = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L84] tmp___0 = __VERIFIER_nondet_int() [L86] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L94] tmp___2 = __VERIFIER_nondet_int() [L96] COND TRUE \read(tmp___2) [L98] CALL startSystem() [L304] systemActive = 1 [L98] RET startSystem() [L113] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L141] COND TRUE \read(pumpRunning) [L143] CALL lowerWaterLevel() [L825] COND TRUE waterLevel > 0 [L826] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L143] RET lowerWaterLevel() [L148] COND TRUE \read(systemActive) [L150] CALL processEnvironment() [L170] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L173] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L188] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L150] RET processEnvironment() [L156] CALL __utac_acc__Specification4_spec__1() [L914] int tmp ; [L915] int tmp___0 ; [L919] CALL, EXPR getWaterLevel() [L890] int retValue_acc ; [L893] retValue_acc = waterLevel [L894] return (retValue_acc); [L919] RET, EXPR getWaterLevel() [L919] tmp = getWaterLevel() [L921] COND TRUE tmp == 0 [L923] CALL, EXPR isPumpRunning() [L222] int retValue_acc ; [L225] retValue_acc = pumpRunning [L226] return (retValue_acc); [L923] RET, EXPR isPumpRunning() [L923] tmp___0 = isPumpRunning() [L925] COND TRUE \read(tmp___0) [L927] CALL __automaton_fail() [L447] 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 6 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 578 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 560 mSDsluCounter, 1239 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 786 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 453 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 687 SizeOfPredicates, 2 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 73/83 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-10-12 19:41:58,158 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