./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.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 b1a2a4f6154f8b607411cb85c1a9c20d409d0ca16407a9f3bb2fc8f7ede01236 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:39:11,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:39:11,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:39:11,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:39:11,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:39:11,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:39:11,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:39:11,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:39:11,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:39:11,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:39:11,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:39:11,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:39:11,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:39:11,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:39:11,738 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:39:11,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:39:11,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:39:11,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:39:11,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:39:11,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:39:11,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:39:11,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:39:11,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:39:11,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:39:11,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:39:11,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:39:11,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:39:11,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:39:11,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:39:11,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:39:11,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:39:11,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:39:11,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:11,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:39:11,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:39:11,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:39:11,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:39:11,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:39:11,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:39:11,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:39:11,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:39:11,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:39:11,749 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 -> b1a2a4f6154f8b607411cb85c1a9c20d409d0ca16407a9f3bb2fc8f7ede01236 [2024-10-12 19:39:11,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:39:12,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:39:12,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:39:12,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:39:12,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:39:12,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2024-10-12 19:39:13,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:39:13,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:39:13,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c [2024-10-12 19:39:13,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4517f100e/5da15f251eb74be39c80007ce60c75c9/FLAG71efc0084 [2024-10-12 19:39:13,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4517f100e/5da15f251eb74be39c80007ce60c75c9 [2024-10-12 19:39:13,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:39:13,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:39:13,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:13,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:39:13,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:39:13,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:13" (1/1) ... [2024-10-12 19:39:13,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a780108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:13, skipping insertion in model container [2024-10-12 19:39:13,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:39:13" (1/1) ... [2024-10-12 19:39:13,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:39:14,060 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c[12584,12597] [2024-10-12 19:39:14,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:14,103 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:39:14,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-10-12 19:39:14,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [153] [2024-10-12 19:39:14,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [519] [2024-10-12 19:39:14,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [528] [2024-10-12 19:39:14,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [627] [2024-10-12 19:39:14,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [695] [2024-10-12 19:39:14,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [859] [2024-10-12 19:39:14,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [885] [2024-10-12 19:39:14,157 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product34.cil.c[12584,12597] [2024-10-12 19:39:14,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:39:14,196 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:39:14,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14 WrapperNode [2024-10-12 19:39:14,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:39:14,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:14,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:39:14,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:39:14,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,233 INFO L138 Inliner]: procedures = 53, calls = 94, calls flagged for inlining = 20, calls inlined = 17, statements flattened = 167 [2024-10-12 19:39:14,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:39:14,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:39:14,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:39:14,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:39:14,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:39:14,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:39:14,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:39:14,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:39:14,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:39:14,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (1/1) ... [2024-10-12 19:39:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:39:14,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:39:14,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:39:14,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:39:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:39:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:39:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:39:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:39:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:39:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:39:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:39:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:39:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:39:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:39:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:39:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:39:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:39:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:39:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:39:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:39:14,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:39:14,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:39:14,823 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-12 19:39:14,823 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:39:14,890 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:39:14,891 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:39:14,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:14 BoogieIcfgContainer [2024-10-12 19:39:14,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:39:14,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:39:14,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:39:14,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:39:14,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:39:13" (1/3) ... [2024-10-12 19:39:14,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2719e196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:14, skipping insertion in model container [2024-10-12 19:39:14,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:39:14" (2/3) ... [2024-10-12 19:39:14,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2719e196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:39:14, skipping insertion in model container [2024-10-12 19:39:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:14" (3/3) ... [2024-10-12 19:39:14,901 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product34.cil.c [2024-10-12 19:39:14,917 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:39:14,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:39:14,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:39:14,992 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;@5fab568e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:39:14,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:39:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 19:39:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:39:15,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:15,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:15,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 364840856, now seen corresponding path program 1 times [2024-10-12 19:39:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648901962] [2024-10-12 19:39:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:39:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648901962] [2024-10-12 19:39:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648901962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:15,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:15,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:39:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19144354] [2024-10-12 19:39:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:39:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:39:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:15,249 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:15,299 INFO L93 Difference]: Finished difference Result 114 states and 165 transitions. [2024-10-12 19:39:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:39:15,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 19:39:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:15,308 INFO L225 Difference]: With dead ends: 114 [2024-10-12 19:39:15,309 INFO L226 Difference]: Without dead ends: 53 [2024-10-12 19:39:15,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:39:15,315 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:15,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-12 19:39:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-12 19:39:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 43 states have internal predecessors, (54), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 19:39:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-10-12 19:39:15,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 16 [2024-10-12 19:39:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:15,366 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-12 19:39:15,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-10-12 19:39:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:39:15,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:15,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:15,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:39:15,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1265390457, now seen corresponding path program 1 times [2024-10-12 19:39:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:15,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180769270] [2024-10-12 19:39:15,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:39:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180769270] [2024-10-12 19:39:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180769270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914088545] [2024-10-12 19:39:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:15,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,495 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:15,528 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2024-10-12 19:39:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:15,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 19:39:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:15,530 INFO L225 Difference]: With dead ends: 79 [2024-10-12 19:39:15,530 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 19:39:15,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,532 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:15,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 89 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 19:39:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-12 19:39:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 38 states have internal predecessors, (48), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 19:39:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-12 19:39:15,539 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2024-10-12 19:39:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:15,539 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-12 19:39:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-12 19:39:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 19:39:15,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:15,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:39:15,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash 272239959, now seen corresponding path program 1 times [2024-10-12 19:39:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863521123] [2024-10-12 19:39:15,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863521123] [2024-10-12 19:39:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863521123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:15,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:15,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295588488] [2024-10-12 19:39:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:15,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:15,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:15,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:15,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,675 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:15,712 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2024-10-12 19:39:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:15,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-12 19:39:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:15,714 INFO L225 Difference]: With dead ends: 88 [2024-10-12 19:39:15,714 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 19:39:15,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,717 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:15,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 19:39:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-12 19:39:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 38 states have internal predecessors, (47), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 19:39:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-12 19:39:15,726 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 20 [2024-10-12 19:39:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:15,727 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-12 19:39:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-12 19:39:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 19:39:15,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:15,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:39:15,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash 904201764, now seen corresponding path program 1 times [2024-10-12 19:39:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:15,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300172805] [2024-10-12 19:39:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:39:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:39:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300172805] [2024-10-12 19:39:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300172805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701608788] [2024-10-12 19:39:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:15,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:15,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,795 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:15,846 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2024-10-12 19:39:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:15,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-12 19:39:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:15,847 INFO L225 Difference]: With dead ends: 122 [2024-10-12 19:39:15,847 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 19:39:15,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:15,849 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 49 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:15,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 96 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 19:39:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2024-10-12 19:39:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 62 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-12 19:39:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2024-10-12 19:39:15,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 25 [2024-10-12 19:39:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2024-10-12 19:39:15,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2024-10-12 19:39:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 19:39:15,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:15,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:39:15,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 714402745, now seen corresponding path program 1 times [2024-10-12 19:39:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425064925] [2024-10-12 19:39:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:39:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:15,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425064925] [2024-10-12 19:39:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425064925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:15,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:39:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153715045] [2024-10-12 19:39:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:15,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:16,010 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:16,084 INFO L93 Difference]: Finished difference Result 154 states and 203 transitions. [2024-10-12 19:39:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 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 27 [2024-10-12 19:39:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:16,086 INFO L225 Difference]: With dead ends: 154 [2024-10-12 19:39:16,088 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 19:39:16,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:16,090 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:16,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:39:16,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 19:39:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-12 19:39:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 64 states have internal predecessors, (80), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-12 19:39:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-12 19:39:16,111 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 27 [2024-10-12 19:39:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:16,112 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-12 19:39:16,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-12 19:39:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 19:39:16,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:16,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:16,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:39:16,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:16,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 972568183, now seen corresponding path program 1 times [2024-10-12 19:39:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71883708] [2024-10-12 19:39:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:39:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71883708] [2024-10-12 19:39:16,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71883708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:16,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:16,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:39:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117220584] [2024-10-12 19:39:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:16,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:16,205 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:16,267 INFO L93 Difference]: Finished difference Result 158 states and 209 transitions. [2024-10-12 19:39:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 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 27 [2024-10-12 19:39:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:16,273 INFO L225 Difference]: With dead ends: 158 [2024-10-12 19:39:16,273 INFO L226 Difference]: Without dead ends: 81 [2024-10-12 19:39:16,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:16,275 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:16,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-12 19:39:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-12 19:39:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-12 19:39:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-10-12 19:39:16,294 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 27 [2024-10-12 19:39:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:16,295 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-10-12 19:39:16,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-10-12 19:39:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 19:39:16,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:16,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:39:16,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -38549067, now seen corresponding path program 1 times [2024-10-12 19:39:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107791601] [2024-10-12 19:39:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:39:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:16,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107791601] [2024-10-12 19:39:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107791601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:39:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17024200] [2024-10-12 19:39:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:39:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:39:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:16,381 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:16,427 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2024-10-12 19:39:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:39:16,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2024-10-12 19:39:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:16,432 INFO L225 Difference]: With dead ends: 198 [2024-10-12 19:39:16,432 INFO L226 Difference]: Without dead ends: 119 [2024-10-12 19:39:16,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:39:16,433 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:16,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-12 19:39:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-12 19:39:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 94 states have internal predecessors, (116), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-12 19:39:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-10-12 19:39:16,454 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 27 [2024-10-12 19:39:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:16,454 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-10-12 19:39:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:39:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-10-12 19:39:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 19:39:16,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:16,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:16,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:39:16,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:16,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 113248384, now seen corresponding path program 1 times [2024-10-12 19:39:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169471796] [2024-10-12 19:39:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:39:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:39:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169471796] [2024-10-12 19:39:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169471796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:16,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:39:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617838365] [2024-10-12 19:39:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:16,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:39:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:39:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:39:16,528 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:16,587 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2024-10-12 19:39:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:39:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-12 19:39:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:16,589 INFO L225 Difference]: With dead ends: 119 [2024-10-12 19:39:16,589 INFO L226 Difference]: Without dead ends: 117 [2024-10-12 19:39:16,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:39:16,590 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:16,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:39:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-12 19:39:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-12 19:39:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 94 states have internal predecessors, (114), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-12 19:39:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2024-10-12 19:39:16,610 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 30 [2024-10-12 19:39:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:16,610 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2024-10-12 19:39:16,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2024-10-12 19:39:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 19:39:16,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:16,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:16,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:39:16,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:16,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash -687327089, now seen corresponding path program 1 times [2024-10-12 19:39:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096065711] [2024-10-12 19:39:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:39:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:39:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:39:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:39:16,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:39:16,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096065711] [2024-10-12 19:39:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096065711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:39:16,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:39:16,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:39:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981901511] [2024-10-12 19:39:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:39:16,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:39:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:39:16,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:39:16,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:39:16,727 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:17,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:39:17,005 INFO L93 Difference]: Finished difference Result 410 states and 528 transitions. [2024-10-12 19:39:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:39:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-12 19:39:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:39:17,008 INFO L225 Difference]: With dead ends: 410 [2024-10-12 19:39:17,008 INFO L226 Difference]: Without dead ends: 295 [2024-10-12 19:39:17,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:39:17,014 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 92 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:39:17,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 198 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:39:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-12 19:39:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2024-10-12 19:39:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 237 states have internal predecessors, (274), 38 states have call successors, (38), 30 states have call predecessors, (38), 34 states have return successors, (51), 36 states have call predecessors, (51), 38 states have call successors, (51) [2024-10-12 19:39:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 363 transitions. [2024-10-12 19:39:17,057 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 363 transitions. Word has length 31 [2024-10-12 19:39:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:39:17,058 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 363 transitions. [2024-10-12 19:39:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:39:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 363 transitions. [2024-10-12 19:39:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:39:17,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:39:17,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:17,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:39:17,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:39:17,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:39:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1357352725, now seen corresponding path program 1 times [2024-10-12 19:39:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:39:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100525389] [2024-10-12 19:39:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:39:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:39:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:39:17,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:39:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:39:17,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:39:17,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:39:17,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:39:17,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:39:17,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:39:17,161 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:39:17,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:39:17 BoogieIcfgContainer [2024-10-12 19:39:17,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:39:17,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:39:17,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:39:17,165 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:39:17,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:39:14" (3/4) ... [2024-10-12 19:39:17,166 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:39:17,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:39:17,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:39:17,226 INFO L158 Benchmark]: Toolchain (without parser) took 3517.30ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 93.6MB in the beginning and 121.4MB in the end (delta: -27.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,226 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 146.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:39:17,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.55ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 72.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.27ms. Allocated memory is still 146.8MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,227 INFO L158 Benchmark]: Boogie Preprocessor took 49.61ms. Allocated memory is still 146.8MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,227 INFO L158 Benchmark]: RCFGBuilder took 607.48ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 68.5MB in the beginning and 137.1MB in the end (delta: -68.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,228 INFO L158 Benchmark]: TraceAbstraction took 2269.50ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 124.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,228 INFO L158 Benchmark]: Witness Printer took 60.71ms. Allocated memory is still 184.5MB. Free memory was 124.6MB in the beginning and 121.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:39:17,229 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.08ms. Allocated memory is still 146.8MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.55ms. Allocated memory is still 146.8MB. Free memory was 93.3MB in the beginning and 72.9MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.27ms. Allocated memory is still 146.8MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.61ms. Allocated memory is still 146.8MB. Free memory was 70.5MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.48ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 68.5MB in the beginning and 137.1MB in the end (delta: -68.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2269.50ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 124.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 60.71ms. Allocated memory is still 184.5MB. Free memory was 124.6MB in the beginning and 121.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [153] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [519] - GenericResultAtLocation [Line: 528]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [528] - GenericResultAtLocation [Line: 627]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [627] - GenericResultAtLocation [Line: 695]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [695] - GenericResultAtLocation [Line: 859]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [859] - GenericResultAtLocation [Line: 885]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [885] * 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: 524]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L50] int cleanupTimeShifts = 4; [L323] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L534] int waterLevel = 1; [L535] int methaneLevelCritical = 0; [L699] int pumpRunning = 0; [L700] int systemActive = 1; [L131] int retValue_acc ; [L132] int tmp ; [L136] FCALL select_helpers() [L137] FCALL select_features() [L138] CALL, EXPR valid_product() [L912] int retValue_acc ; [L915] retValue_acc = 1 [L916] return (retValue_acc); [L138] RET, EXPR valid_product() [L138] tmp = valid_product() [L140] COND TRUE \read(tmp) [L142] FCALL setup() [L143] CALL runTest() [L122] CALL test() [L630] int splverifierCounter ; [L631] int tmp ; [L632] int tmp___0 ; [L633] int tmp___1 ; [L634] int tmp___2 ; [L637] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L639] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L641] COND TRUE splverifierCounter < 4 [L647] tmp = __VERIFIER_nondet_int() [L649] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L651] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L552] COND TRUE waterLevel < 2 [L553] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L651] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L657] tmp___0 = __VERIFIER_nondet_int() [L659] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L661] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] COND FALSE !(\read(methaneLevelCritical)) [L567] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L661] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L667] tmp___2 = __VERIFIER_nondet_int() [L669] COND TRUE \read(tmp___2) [L671] CALL startSystem() [L855] systemActive = 1 [L671] RET startSystem() [L684] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L707] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L714] COND TRUE \read(systemActive) [L716] CALL processEnvironment() [L736] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L739] COND TRUE ! pumpRunning [L741] CALL, EXPR isHighWaterLevel() [L833] int retValue_acc ; [L834] int tmp ; [L835] int tmp___0 ; [L839] CALL, EXPR isHighWaterSensorDry() [L614] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L617] COND FALSE !(waterLevel < 2) [L621] retValue_acc = 0 [L622] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L839] RET, EXPR isHighWaterSensorDry() [L839] tmp = isHighWaterSensorDry() [L841] COND FALSE !(\read(tmp)) [L844] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L846] retValue_acc = tmp___0 [L847] return (retValue_acc); [L741] RET, EXPR isHighWaterLevel() [L741] tmp = isHighWaterLevel() [L743] COND TRUE \read(tmp) [L745] CALL activatePump() [L764] pumpRunning = 1 [L745] RET activatePump() [L716] RET processEnvironment() [L722] CALL __utac_acc__Specification1_spec__1() [L861] int tmp ; [L862] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L866] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L573] int retValue_acc ; [L576] retValue_acc = methaneLevelCritical [L577] return (retValue_acc); [L866] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L866] tmp = isMethaneLevelCritical() [L868] COND TRUE \read(tmp) [L870] CALL, EXPR isPumpRunning() [L788] int retValue_acc ; [L791] retValue_acc = pumpRunning [L792] return (retValue_acc); [L870] RET, EXPR isPumpRunning() [L870] tmp___0 = isPumpRunning() [L872] COND TRUE \read(tmp___0) [L874] CALL __automaton_fail() [L524] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 1002 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 454 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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:39:17,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE