./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product50.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 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:52:00,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:52:01,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:52:01,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:52:01,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:52:01,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:52:01,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:52:01,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:52:01,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:52:01,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:52:01,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:52:01,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:52:01,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:52:01,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:52:01,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:52:01,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:52:01,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:52:01,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:52:01,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:52:01,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:52:01,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:52:01,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:52:01,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:52:01,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:52:01,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:52:01,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:52:01,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:52:01,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:52:01,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:52:01,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:52:01,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:52:01,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:52:01,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:01,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:52:01,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:52:01,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:52:01,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:52:01,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:52:01,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:52:01,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:52:01,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:52:01,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:52:01,108 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 -> 7291fd5b9449f17989061ec30bdd7b74e8732c40c8095270267a47672f4a66be [2024-11-16 07:52:01,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:52:01,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:52:01,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:52:01,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:52:01,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:52:01,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-16 07:52:02,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:52:03,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:52:03,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c [2024-11-16 07:52:03,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801f57fd1/475cdb8c3f364c9c9257c9ff8189f7b3/FLAGd9a028815 [2024-11-16 07:52:03,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801f57fd1/475cdb8c3f364c9c9257c9ff8189f7b3 [2024-11-16 07:52:03,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:52:03,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:52:03,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:03,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:52:03,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:52:03,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f720fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03, skipping insertion in model container [2024-11-16 07:52:03,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:52:03,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c[6254,6267] [2024-11-16 07:52:03,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:03,611 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:52:03,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] [2024-11-16 07:52:03,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] [2024-11-16 07:52:03,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] [2024-11-16 07:52:03,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] [2024-11-16 07:52:03,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] [2024-11-16 07:52:03,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] [2024-11-16 07:52:03,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] [2024-11-16 07:52:03,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] [2024-11-16 07:52:03,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product50.cil.c[6254,6267] [2024-11-16 07:52:03,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:52:03,714 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:52:03,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03 WrapperNode [2024-11-16 07:52:03,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:52:03,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:03,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:52:03,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:52:03,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,785 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 200 [2024-11-16 07:52:03,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:52:03,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:52:03,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:52:03,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:52:03,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 07:52:03,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:52:03,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:52:03,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:52:03,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:52:03,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (1/1) ... [2024-11-16 07:52:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:52:03,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:52:03,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:52:03,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:52:03,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:52:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:52:03,943 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:52:03,943 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:52:03,943 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:52:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:52:03,944 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:52:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:52:03,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:52:03,944 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:03,945 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-16 07:52:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:52:03,945 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:52:03,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:52:03,946 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:52:03,946 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:52:03,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:52:03,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:52:04,092 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:52:04,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:52:04,231 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L185-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~3#1; [2024-11-16 07:52:04,232 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~10#1; [2024-11-16 07:52:04,232 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L524-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~8#1; [2024-11-16 07:52:04,251 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: #res := ~retValue_acc~0; [2024-11-16 07:52:04,311 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L322-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-16 07:52:04,312 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L287-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-16 07:52:04,338 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L176-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2024-11-16 07:52:04,338 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L579-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~9#1; [2024-11-16 07:52:04,369 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-16 07:52:04,369 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:52:04,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:52:04,381 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:52:04,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:04 BoogieIcfgContainer [2024-11-16 07:52:04,381 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:52:04,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:52:04,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:52:04,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:52:04,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:52:03" (1/3) ... [2024-11-16 07:52:04,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b2ae74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:04, skipping insertion in model container [2024-11-16 07:52:04,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:52:03" (2/3) ... [2024-11-16 07:52:04,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b2ae74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:52:04, skipping insertion in model container [2024-11-16 07:52:04,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:04" (3/3) ... [2024-11-16 07:52:04,390 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product50.cil.c [2024-11-16 07:52:04,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:52:04,408 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:52:04,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:52:04,479 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;@5b2cb9c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:52:04,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:52:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 81 states have internal predecessors, (99), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 07:52:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 07:52:04,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:04,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:04,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1937335597, now seen corresponding path program 1 times [2024-11-16 07:52:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960341111] [2024-11-16 07:52:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 07:52:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:04,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960341111] [2024-11-16 07:52:04,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960341111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:04,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:52:04,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96865799] [2024-11-16 07:52:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:52:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:52:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:52:04,780 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 81 states have internal predecessors, (99), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-11-16 07:52:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:04,818 INFO L93 Difference]: Finished difference Result 177 states and 236 transitions. [2024-11-16 07:52:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:52:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 25 [2024-11-16 07:52:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:04,832 INFO L225 Difference]: With dead ends: 177 [2024-11-16 07:52:04,833 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 07:52:04,837 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-11-16 07:52:04,843 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:04,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 07:52:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 07:52:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.296875) internal successors, (83), 71 states have internal predecessors, (83), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 07:52:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2024-11-16 07:52:04,896 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 25 [2024-11-16 07:52:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:04,898 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2024-11-16 07:52:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-11-16 07:52:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2024-11-16 07:52:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 07:52:04,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:04,903 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] [2024-11-16 07:52:04,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:52:04,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:04,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1497126334, now seen corresponding path program 1 times [2024-11-16 07:52:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103143938] [2024-11-16 07:52:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:52:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103143938] [2024-11-16 07:52:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103143938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:05,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:05,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983774446] [2024-11-16 07:52:05,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:05,069 INFO L87 Difference]: Start difference. First operand 82 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), 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-11-16 07:52:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:05,096 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2024-11-16 07:52:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:05,097 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), 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 28 [2024-11-16 07:52:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:05,099 INFO L225 Difference]: With dead ends: 126 [2024-11-16 07:52:05,100 INFO L226 Difference]: Without dead ends: 71 [2024-11-16 07:52:05,101 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-11-16 07:52:05,103 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:05,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-16 07:52:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-16 07:52:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:52:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2024-11-16 07:52:05,116 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 28 [2024-11-16 07:52:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2024-11-16 07:52:05,117 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), 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-11-16 07:52:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2024-11-16 07:52:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 07:52:05,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:05,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:52:05,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:05,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1529834011, now seen corresponding path program 1 times [2024-11-16 07:52:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:05,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531768297] [2024-11-16 07:52:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531768297] [2024-11-16 07:52:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531768297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:05,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709394190] [2024-11-16 07:52:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:05,294 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-11-16 07:52:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:05,353 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2024-11-16 07:52:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:52:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2024-11-16 07:52:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:05,355 INFO L225 Difference]: With dead ends: 135 [2024-11-16 07:52:05,356 INFO L226 Difference]: Without dead ends: 71 [2024-11-16 07:52:05,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:05,357 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:05,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 256 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-16 07:52:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-16 07:52:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 63 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:52:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-11-16 07:52:05,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 31 [2024-11-16 07:52:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-11-16 07:52:05,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-11-16 07:52:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-11-16 07:52:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:52:05,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:05,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:05,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:52:05,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1318107290, now seen corresponding path program 1 times [2024-11-16 07:52:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328115651] [2024-11-16 07:52:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:52:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328115651] [2024-11-16 07:52:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328115651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:05,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:52:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006408229] [2024-11-16 07:52:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:05,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:52:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:52:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:52:05,453 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11-16 07:52:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:05,511 INFO L93 Difference]: Finished difference Result 180 states and 231 transitions. [2024-11-16 07:52:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:52:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 39 [2024-11-16 07:52:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:05,516 INFO L225 Difference]: With dead ends: 180 [2024-11-16 07:52:05,516 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 07:52:05,516 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-11-16 07:52:05,521 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 69 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:05,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 166 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:52:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 07:52:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-16 07:52:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 95 states have internal predecessors, (113), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-16 07:52:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2024-11-16 07:52:05,545 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 39 [2024-11-16 07:52:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:05,546 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2024-11-16 07:52:05,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11-16 07:52:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2024-11-16 07:52:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 07:52:05,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:05,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:52:05,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:05,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1892888165, now seen corresponding path program 1 times [2024-11-16 07:52:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:05,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933041037] [2024-11-16 07:52:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 07:52:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933041037] [2024-11-16 07:52:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933041037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:05,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:52:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784218198] [2024-11-16 07:52:05,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:52:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:05,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:52:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:52:05,740 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:05,913 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2024-11-16 07:52:05,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:52:05,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-16 07:52:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:05,915 INFO L225 Difference]: With dead ends: 247 [2024-11-16 07:52:05,915 INFO L226 Difference]: Without dead ends: 141 [2024-11-16 07:52:05,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:52:05,921 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 50 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:05,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 351 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:52:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-16 07:52:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-16 07:52:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 115 states have internal predecessors, (137), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-16 07:52:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2024-11-16 07:52:05,953 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 45 [2024-11-16 07:52:05,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:05,954 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2024-11-16 07:52:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2024-11-16 07:52:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 07:52:05,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:05,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:05,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:52:05,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:05,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1048416294, now seen corresponding path program 1 times [2024-11-16 07:52:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:05,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471676881] [2024-11-16 07:52:05,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 07:52:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471676881] [2024-11-16 07:52:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471676881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:06,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:06,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933753710] [2024-11-16 07:52:06,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:06,100 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:06,226 INFO L93 Difference]: Finished difference Result 274 states and 350 transitions. [2024-11-16 07:52:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:52:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-16 07:52:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:06,230 INFO L225 Difference]: With dead ends: 274 [2024-11-16 07:52:06,230 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 07:52:06,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:06,232 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 49 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:06,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 275 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:52:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 07:52:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2024-11-16 07:52:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 117 states have internal predecessors, (139), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-11-16 07:52:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2024-11-16 07:52:06,260 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 45 [2024-11-16 07:52:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:06,260 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2024-11-16 07:52:06,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2024-11-16 07:52:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 07:52:06,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:06,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:06,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:52:06,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:06,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1471118120, now seen corresponding path program 1 times [2024-11-16 07:52:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818309984] [2024-11-16 07:52:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 07:52:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818309984] [2024-11-16 07:52:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818309984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:52:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529864604] [2024-11-16 07:52:06,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:06,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:52:06,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:06,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:52:06,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:52:06,349 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:06,581 INFO L93 Difference]: Finished difference Result 406 states and 522 transitions. [2024-11-16 07:52:06,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:52:06,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-16 07:52:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:06,585 INFO L225 Difference]: With dead ends: 406 [2024-11-16 07:52:06,585 INFO L226 Difference]: Without dead ends: 273 [2024-11-16 07:52:06,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:52:06,586 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:06,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 289 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:52:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-16 07:52:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 261. [2024-11-16 07:52:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 213 states have internal predecessors, (251), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-11-16 07:52:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 328 transitions. [2024-11-16 07:52:06,614 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 328 transitions. Word has length 45 [2024-11-16 07:52:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:06,615 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 328 transitions. [2024-11-16 07:52:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:52:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 328 transitions. [2024-11-16 07:52:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 07:52:06,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:06,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:06,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:52:06,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:06,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -96570632, now seen corresponding path program 1 times [2024-11-16 07:52:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:06,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352231835] [2024-11-16 07:52:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 07:52:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:52:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:52:06,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352231835] [2024-11-16 07:52:06,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352231835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:06,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:52:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895773353] [2024-11-16 07:52:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:52:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:52:06,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:52:06,767 INFO L87 Difference]: Start difference. First operand 261 states and 328 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:52:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:06,974 INFO L93 Difference]: Finished difference Result 267 states and 332 transitions. [2024-11-16 07:52:06,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:52:06,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-16 07:52:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:06,977 INFO L225 Difference]: With dead ends: 267 [2024-11-16 07:52:06,977 INFO L226 Difference]: Without dead ends: 264 [2024-11-16 07:52:06,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:52:06,981 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 121 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:06,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 292 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:52:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-16 07:52:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2024-11-16 07:52:07,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 202 states have (on average 1.2227722772277227) internal successors, (247), 213 states have internal predecessors, (247), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (48), 29 states have call predecessors, (48), 29 states have call successors, (48) [2024-11-16 07:52:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 324 transitions. [2024-11-16 07:52:07,006 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 324 transitions. Word has length 47 [2024-11-16 07:52:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:07,006 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 324 transitions. [2024-11-16 07:52:07,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:52:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 324 transitions. [2024-11-16 07:52:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 07:52:07,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:07,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:52:07,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1889075210, now seen corresponding path program 1 times [2024-11-16 07:52:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462492333] [2024-11-16 07:52:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:52:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:52:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:52:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:52:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:52:07,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:52:07,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462492333] [2024-11-16 07:52:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462492333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:52:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:52:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:52:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275205287] [2024-11-16 07:52:07,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:52:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:52:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:52:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:52:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:52:07,121 INFO L87 Difference]: Start difference. First operand 261 states and 324 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:52:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:52:07,599 INFO L93 Difference]: Finished difference Result 879 states and 1134 transitions. [2024-11-16 07:52:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 07:52:07,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-16 07:52:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:52:07,604 INFO L225 Difference]: With dead ends: 879 [2024-11-16 07:52:07,605 INFO L226 Difference]: Without dead ends: 625 [2024-11-16 07:52:07,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-16 07:52:07,607 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 268 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:52:07,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 385 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:52:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-16 07:52:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 598. [2024-11-16 07:52:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 459 states have (on average 1.1938997821350763) internal successors, (548), 488 states have internal predecessors, (548), 70 states have call successors, (70), 56 states have call predecessors, (70), 68 states have return successors, (133), 74 states have call predecessors, (133), 70 states have call successors, (133) [2024-11-16 07:52:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 751 transitions. [2024-11-16 07:52:07,680 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 751 transitions. Word has length 49 [2024-11-16 07:52:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:52:07,680 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 751 transitions. [2024-11-16 07:52:07,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 07:52:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 751 transitions. [2024-11-16 07:52:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 07:52:07,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:52:07,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:07,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:52:07,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:52:07,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:52:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 204390059, now seen corresponding path program 1 times [2024-11-16 07:52:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:52:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584109318] [2024-11-16 07:52:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:52:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:52:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:52:07,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:52:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:52:07,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:52:07,739 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:52:07,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:52:07,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 07:52:07,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:52:07,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:52:07,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:52:07 BoogieIcfgContainer [2024-11-16 07:52:07,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:52:07,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:52:07,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:52:07,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:52:07,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:52:04" (3/4) ... [2024-11-16 07:52:07,814 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:52:07,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:52:07,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:52:07,892 INFO L158 Benchmark]: Toolchain (without parser) took 4715.62ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 123.0MB in the beginning and 143.4MB in the end (delta: -20.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,892 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:52:07,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.08ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 101.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.25ms. Allocated memory is still 161.5MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,893 INFO L158 Benchmark]: Boogie Preprocessor took 62.00ms. Allocated memory is still 161.5MB. Free memory was 98.9MB in the beginning and 96.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,893 INFO L158 Benchmark]: IcfgBuilder took 528.60ms. Allocated memory is still 161.5MB. Free memory was 96.8MB in the beginning and 116.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,893 INFO L158 Benchmark]: TraceAbstraction took 3428.82ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 115.2MB in the beginning and 148.6MB in the end (delta: -33.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,894 INFO L158 Benchmark]: Witness Printer took 78.37ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 143.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:52:07,895 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.18ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.08ms. Allocated memory is still 161.5MB. Free memory was 123.0MB in the beginning and 101.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.25ms. Allocated memory is still 161.5MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.00ms. Allocated memory is still 161.5MB. Free memory was 98.9MB in the beginning and 96.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 528.60ms. Allocated memory is still 161.5MB. Free memory was 96.8MB in the beginning and 116.3MB in the end (delta: -19.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3428.82ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 115.2MB in the beginning and 148.6MB in the end (delta: -33.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Witness Printer took 78.37ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 143.4MB in the end (delta: 4.2MB). 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,"Specification1_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [78] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [188] - GenericResultAtLocation [Line: 290]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [290] - GenericResultAtLocation [Line: 325]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [325] - GenericResultAtLocation [Line: 393]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [393] - GenericResultAtLocation [Line: 402]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [402] - GenericResultAtLocation [Line: 609]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [609] * 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: 398]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L86] int waterLevel = 1; [L87] int methaneLevelCritical = 0; [L189] int cleanupTimeShifts = 4; [L405] int pumpRunning = 0; [L406] int systemActive = 1; [L779] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L268] int retValue_acc ; [L269] int tmp ; [L273] FCALL select_helpers() [L274] FCALL select_features() [L275] CALL, EXPR valid_product() [L317] int retValue_acc ; [L320] retValue_acc = 1 [L321] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L275] RET, EXPR valid_product() [L275] tmp = valid_product() [L277] COND TRUE \read(tmp) [L279] FCALL setup() [L280] CALL runTest() [L259] CALL test() [L328] int splverifierCounter ; [L329] int tmp ; [L330] int tmp___0 ; [L331] int tmp___1 ; [L332] int tmp___2 ; [L335] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L337] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L339] COND TRUE splverifierCounter < 4 [L345] tmp = __VERIFIER_nondet_int() [L347] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L349] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L104] COND TRUE waterLevel < 2 [L105] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L349] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L355] tmp___0 = __VERIFIER_nondet_int() [L357] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L359] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L116] COND FALSE !(\read(methaneLevelCritical)) [L119] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L359] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L365] tmp___2 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp___2) [L369] CALL startSystem() [L605] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L369] RET startSystem() [L382] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L412] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L419] COND TRUE \read(systemActive) [L421] CALL processEnvironment() [L467] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L470] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L485] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L444] COND TRUE ! pumpRunning [L446] CALL, EXPR isHighWaterLevel() [L564] int retValue_acc ; [L565] int tmp ; [L566] int tmp___0 ; [L570] CALL, EXPR isHighWaterSensorDry() [L166] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L169] COND FALSE !(waterLevel < 2) [L173] retValue_acc = 0 [L174] 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] [L570] RET, EXPR isHighWaterSensorDry() [L570] tmp = isHighWaterSensorDry() [L572] COND FALSE !(\read(tmp)) [L575] 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] [L577] retValue_acc = tmp___0 [L578] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L446] RET, EXPR isHighWaterLevel() [L446] tmp = isHighWaterLevel() [L448] COND TRUE \read(tmp) [L450] CALL activatePump() [L495] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L450] RET activatePump() [L485] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L421] RET processEnvironment() [L427] CALL __utac_acc__Specification1_spec__1() [L54] int tmp ; [L55] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L125] int retValue_acc ; [L128] retValue_acc = methaneLevelCritical [L129] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L59] tmp = isMethaneLevelCritical() [L61] COND TRUE \read(tmp) [L63] CALL, EXPR isPumpRunning() [L519] int retValue_acc ; [L522] retValue_acc = pumpRunning [L523] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L398] 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 8 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 851 mSDsluCounter, 2288 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1471 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 754 IncrementalHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 817 mSDtfsCounter, 754 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 549 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-11-16 07:52:07,931 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