./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product35.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_product35.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 d8d5749cb33f10edd647435755bf2e2192f6038b258c1bda289ea3f61ba8ee50 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:51:47,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:51:47,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:51:47,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:51:47,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:51:47,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:51:47,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:51:47,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:51:47,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:51:47,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:51:47,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:51:47,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:51:47,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:51:47,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:51:47,422 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:51:47,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:51:47,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:51:47,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:51:47,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:51:47,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:51:47,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:51:47,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:51:47,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:51:47,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:51:47,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:51:47,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:51:47,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:51:47,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:51:47,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:51:47,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:51:47,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:51:47,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:51:47,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:51:47,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:51:47,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:51:47,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:51:47,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:51:47,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:51:47,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:51:47,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:51:47,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:51:47,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:51:47,431 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 -> d8d5749cb33f10edd647435755bf2e2192f6038b258c1bda289ea3f61ba8ee50 [2024-11-16 07:51:47,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:51:47,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:51:47,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:51:47,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:51:47,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:51:47,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2024-11-16 07:51:49,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:51:49,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:51:49,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2024-11-16 07:51:49,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceab0c81d/e1b0a1b071f743bf9dea1f2360cd20bc/FLAGc246e2790 [2024-11-16 07:51:49,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceab0c81d/e1b0a1b071f743bf9dea1f2360cd20bc [2024-11-16 07:51:49,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:51:49,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:51:49,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:51:49,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:51:49,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:51:49,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:51:49" (1/1) ... [2024-11-16 07:51:49,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6485493b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:49, skipping insertion in model container [2024-11-16 07:51:49,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:51:49" (1/1) ... [2024-11-16 07:51:49,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:51:49,756 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_product35.cil.c[3064,3077] [2024-11-16 07:51:49,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:51:49,885 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:51:49,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-16 07:51:49,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2024-11-16 07:51:49,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] [2024-11-16 07:51:49,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [186] [2024-11-16 07:51:49,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [256] [2024-11-16 07:51:49,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [426] [2024-11-16 07:51:49,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [464] [2024-11-16 07:51:49,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [560] [2024-11-16 07:51:49,906 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_product35.cil.c[3064,3077] [2024-11-16 07:51:49,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:51:50,010 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:51:50,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50 WrapperNode [2024-11-16 07:51:50,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:51:50,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:51:50,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:51:50,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:51:50,040 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:51:50" (1/1) ... [2024-11-16 07:51:50,060 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:51:50" (1/1) ... [2024-11-16 07:51:50,084 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 170 [2024-11-16 07:51:50,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:51:50,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:51:50,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:51:50,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:51:50,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,118 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:51:50,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:51:50,130 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:51:50,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:51:50,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:51:50,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (1/1) ... [2024-11-16 07:51:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:51:50,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:51:50,179 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:51:50,182 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:51:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:51:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:51:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:51:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:51:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:51:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:51:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:51:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-16 07:51:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-16 07:51:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:51:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:51:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:51:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:51:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:51:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:51:50,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:51:50,297 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:51:50,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:51:50,469 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L353-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~4#1; [2024-11-16 07:51:50,469 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L147-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2024-11-16 07:51:50,469 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L408-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; [2024-11-16 07:51:50,475 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: #res := ~retValue_acc~0; [2024-11-16 07:51:50,573 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L461-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2024-11-16 07:51:50,573 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L557-1: main_#res#1 := main_~retValue_acc~8#1; [2024-11-16 07:51:50,599 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-16 07:51:50,603 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:51:50,618 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:51:50,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:51:50,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:51:50 BoogieIcfgContainer [2024-11-16 07:51:50,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:51:50,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:51:50,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:51:50,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:51:50,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:51:49" (1/3) ... [2024-11-16 07:51:50,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541d8f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:51:50, skipping insertion in model container [2024-11-16 07:51:50,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:51:50" (2/3) ... [2024-11-16 07:51:50,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541d8f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:51:50, skipping insertion in model container [2024-11-16 07:51:50,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:51:50" (3/3) ... [2024-11-16 07:51:50,630 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product35.cil.c [2024-11-16 07:51:50,647 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:51:50,647 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:51:50,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:51:50,727 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;@5aa6358d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:51:50,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:51:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 73 states have internal predecessors, (91), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 07:51:50,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 07:51:50,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:50,744 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:51:50,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1373891430, now seen corresponding path program 1 times [2024-11-16 07:51:50,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474141763] [2024-11-16 07:51:50,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 07:51:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:50,931 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:51:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474141763] [2024-11-16 07:51:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474141763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:50,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:51:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852539663] [2024-11-16 07:51:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:50,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:51:50,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:50,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:51:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:51:50,961 INFO L87 Difference]: Start difference. First operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 73 states have internal predecessors, (91), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 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:51:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:50,987 INFO L93 Difference]: Finished difference Result 159 states and 212 transitions. [2024-11-16 07:51:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:51:50,989 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:51:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:51,004 INFO L225 Difference]: With dead ends: 159 [2024-11-16 07:51:51,004 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 07:51:51,007 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:51:51,011 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:51,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 07:51:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 07:51:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.293103448275862) internal successors, (75), 63 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:51:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2024-11-16 07:51:51,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 25 [2024-11-16 07:51:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:51,063 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2024-11-16 07:51:51,064 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:51:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2024-11-16 07:51:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 07:51:51,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:51,067 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:51:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:51:51,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 674528769, now seen corresponding path program 1 times [2024-11-16 07:51:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421967672] [2024-11-16 07:51:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:51:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,194 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:51:51,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421967672] [2024-11-16 07:51:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421967672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:51:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234414083] [2024-11-16 07:51:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:51,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:51:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:51:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:51:51,201 INFO L87 Difference]: Start difference. First operand 73 states and 92 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:51:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:51,227 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2024-11-16 07:51:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:51:51,227 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:51:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:51,229 INFO L225 Difference]: With dead ends: 105 [2024-11-16 07:51:51,229 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 07:51:51,229 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:51:51,231 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 132 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:51:51,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 132 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 07:51:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 07:51:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.32) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 07:51:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-11-16 07:51:51,245 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 28 [2024-11-16 07:51:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:51,246 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-11-16 07:51:51,246 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:51:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-11-16 07:51:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 07:51:51,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:51,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:51:51,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1636987462, now seen corresponding path program 1 times [2024-11-16 07:51:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100653884] [2024-11-16 07:51:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:51:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,422 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:51:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100653884] [2024-11-16 07:51:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100653884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:51,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:51:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18287364] [2024-11-16 07:51:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:51,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:51:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:51:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:51:51,425 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:51:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:51,571 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2024-11-16 07:51:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:51:51,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 30 [2024-11-16 07:51:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:51,574 INFO L225 Difference]: With dead ends: 212 [2024-11-16 07:51:51,574 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 07:51:51,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:51:51,576 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 176 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:51,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 346 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:51:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 07:51:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-11-16 07:51:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 125 states have internal predecessors, (154), 16 states have call successors, (16), 14 states have call predecessors, (16), 14 states have return successors, (17), 14 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-16 07:51:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 187 transitions. [2024-11-16 07:51:51,611 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 187 transitions. Word has length 30 [2024-11-16 07:51:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:51,611 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 187 transitions. [2024-11-16 07:51:51,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:51:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 187 transitions. [2024-11-16 07:51:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 07:51:51,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:51,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:51:51,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -120511151, now seen corresponding path program 1 times [2024-11-16 07:51:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119121346] [2024-11-16 07:51:51,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:51:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:51:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,702 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:51:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:51,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119121346] [2024-11-16 07:51:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119121346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:51,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:51:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25470652] [2024-11-16 07:51:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:51,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:51:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:51:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:51:51,705 INFO L87 Difference]: Start difference. First operand 145 states and 187 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:51:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:51,758 INFO L93 Difference]: Finished difference Result 359 states and 471 transitions. [2024-11-16 07:51:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:51:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-16 07:51:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:51,760 INFO L225 Difference]: With dead ends: 359 [2024-11-16 07:51:51,761 INFO L226 Difference]: Without dead ends: 221 [2024-11-16 07:51:51,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:51:51,763 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:51,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 124 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-16 07:51:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2024-11-16 07:51:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.319526627218935) internal successors, (223), 182 states have internal predecessors, (223), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-16 07:51:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 277 transitions. [2024-11-16 07:51:51,799 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 277 transitions. Word has length 35 [2024-11-16 07:51:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:51,800 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 277 transitions. [2024-11-16 07:51:51,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:51:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 277 transitions. [2024-11-16 07:51:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 07:51:51,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:51,801 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] [2024-11-16 07:51:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:51:51,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1331958818, now seen corresponding path program 1 times [2024-11-16 07:51:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275221563] [2024-11-16 07:51:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:51:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:51,941 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:51:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275221563] [2024-11-16 07:51:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275221563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:51:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975020561] [2024-11-16 07:51:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:51,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:51:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:51:51,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:51:51,946 INFO L87 Difference]: Start difference. First operand 218 states and 277 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:52,013 INFO L93 Difference]: Finished difference Result 221 states and 279 transitions. [2024-11-16 07:51:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:51:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2024-11-16 07:51:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:52,016 INFO L225 Difference]: With dead ends: 221 [2024-11-16 07:51:52,016 INFO L226 Difference]: Without dead ends: 218 [2024-11-16 07:51:52,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:51:52,018 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:52,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 265 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-16 07:51:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-11-16 07:51:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 169 states have (on average 1.301775147928994) internal successors, (220), 182 states have internal predecessors, (220), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-16 07:51:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 274 transitions. [2024-11-16 07:51:52,048 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 274 transitions. Word has length 34 [2024-11-16 07:51:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:52,049 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 274 transitions. [2024-11-16 07:51:52,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:51:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 274 transitions. [2024-11-16 07:51:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:51:52,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:52,053 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:51:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:51:52,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -420838584, now seen corresponding path program 1 times [2024-11-16 07:51:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504176090] [2024-11-16 07:51:52,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:51:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,145 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:51:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504176090] [2024-11-16 07:51:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504176090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:51:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42517960] [2024-11-16 07:51:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:51:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:51:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:51:52,149 INFO L87 Difference]: Start difference. First operand 218 states and 274 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:51:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:52,184 INFO L93 Difference]: Finished difference Result 435 states and 554 transitions. [2024-11-16 07:51:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:51:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:51:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:52,189 INFO L225 Difference]: With dead ends: 435 [2024-11-16 07:51:52,191 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 07:51:52,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:51:52,193 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:52,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 07:51:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-16 07:51:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 188 states have internal predecessors, (226), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-16 07:51:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 280 transitions. [2024-11-16 07:51:52,222 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 280 transitions. Word has length 39 [2024-11-16 07:51:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:52,222 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 280 transitions. [2024-11-16 07:51:52,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:51:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 280 transitions. [2024-11-16 07:51:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:51:52,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:52,227 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:51:52,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:51:52,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 932471113, now seen corresponding path program 1 times [2024-11-16 07:51:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251520359] [2024-11-16 07:51:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:51:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,313 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:51:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251520359] [2024-11-16 07:51:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251520359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:52,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:51:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838822023] [2024-11-16 07:51:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:52,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:51:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:52,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:51:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:51:52,317 INFO L87 Difference]: Start difference. First operand 224 states and 280 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:51:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:52,380 INFO L93 Difference]: Finished difference Result 445 states and 569 transitions. [2024-11-16 07:51:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 07:51:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:51:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:52,384 INFO L225 Difference]: With dead ends: 445 [2024-11-16 07:51:52,385 INFO L226 Difference]: Without dead ends: 228 [2024-11-16 07:51:52,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:51:52,387 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:52,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-16 07:51:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-16 07:51:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 192 states have internal predecessors, (230), 24 states have call successors, (24), 24 states have call predecessors, (24), 24 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2024-11-16 07:51:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2024-11-16 07:51:52,411 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 39 [2024-11-16 07:51:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2024-11-16 07:51:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:51:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2024-11-16 07:51:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:51:52,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:52,415 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:51:52,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:51:52,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -756472629, now seen corresponding path program 1 times [2024-11-16 07:51:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276062125] [2024-11-16 07:51:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 07:51:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,507 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:51:52,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276062125] [2024-11-16 07:51:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276062125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:51:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608050357] [2024-11-16 07:51:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:52,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:51:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:51:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:51:52,511 INFO L87 Difference]: Start difference. First operand 228 states and 284 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), 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:51:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:52,544 INFO L93 Difference]: Finished difference Result 567 states and 716 transitions. [2024-11-16 07:51:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:51:52,545 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), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-16 07:51:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:52,547 INFO L225 Difference]: With dead ends: 567 [2024-11-16 07:51:52,547 INFO L226 Difference]: Without dead ends: 346 [2024-11-16 07:51:52,548 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:51:52,549 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:52,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 141 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:51:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-16 07:51:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-16 07:51:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 272 states have (on average 1.2573529411764706) internal successors, (342), 288 states have internal predecessors, (342), 38 states have call successors, (38), 38 states have call predecessors, (38), 35 states have return successors, (45), 35 states have call predecessors, (45), 38 states have call successors, (45) [2024-11-16 07:51:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 425 transitions. [2024-11-16 07:51:52,580 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 425 transitions. Word has length 39 [2024-11-16 07:51:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:52,581 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 425 transitions. [2024-11-16 07:51:52,581 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), 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:51:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 425 transitions. [2024-11-16 07:51:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 07:51:52,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:52,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:51:52,583 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 823492397, now seen corresponding path program 1 times [2024-11-16 07:51:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801329483] [2024-11-16 07:51:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:51:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 07:51:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:51:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801329483] [2024-11-16 07:51:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801329483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:51:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700043301] [2024-11-16 07:51:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:51:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:51:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:51:52,703 INFO L87 Difference]: Start difference. First operand 346 states and 425 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:51:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:52,939 INFO L93 Difference]: Finished difference Result 1168 states and 1476 transitions. [2024-11-16 07:51:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:51:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-16 07:51:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:52,945 INFO L225 Difference]: With dead ends: 1168 [2024-11-16 07:51:52,945 INFO L226 Difference]: Without dead ends: 829 [2024-11-16 07:51:52,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:51:52,948 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 111 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:52,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 356 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:51:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-16 07:51:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 818. [2024-11-16 07:51:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 641 states have (on average 1.2246489859594383) internal successors, (785), 690 states have internal predecessors, (785), 92 states have call successors, (92), 76 states have call predecessors, (92), 84 states have return successors, (128), 86 states have call predecessors, (128), 92 states have call successors, (128) [2024-11-16 07:51:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1005 transitions. [2024-11-16 07:51:53,054 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1005 transitions. Word has length 43 [2024-11-16 07:51:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:53,055 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1005 transitions. [2024-11-16 07:51:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 07:51:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1005 transitions. [2024-11-16 07:51:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 07:51:53,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:53,057 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:51:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:51:53,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1256648562, now seen corresponding path program 1 times [2024-11-16 07:51:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39436997] [2024-11-16 07:51:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:51:53,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:51:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:51:53,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:51:53,108 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:51:53,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:51:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 07:51:53,112 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:53,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:51:53,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:51:53 BoogieIcfgContainer [2024-11-16 07:51:53,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:51:53,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:51:53,154 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:51:53,154 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:51:53,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:51:50" (3/4) ... [2024-11-16 07:51:53,156 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:51:53,227 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:51:53,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:51:53,228 INFO L158 Benchmark]: Toolchain (without parser) took 3748.00ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 90.9MB in the beginning and 140.7MB in the end (delta: -49.7MB). Peak memory consumption was 876.7kB. Max. memory is 16.1GB. [2024-11-16 07:51:53,228 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:51:53,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.90ms. Allocated memory is still 161.5MB. Free memory was 90.7MB in the beginning and 131.4MB in the end (delta: -40.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 07:51:53,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.18ms. Allocated memory is still 161.5MB. Free memory was 131.4MB in the beginning and 129.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:51:53,229 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:51:53,229 INFO L158 Benchmark]: IcfgBuilder took 489.95ms. Allocated memory is still 161.5MB. Free memory was 127.3MB in the beginning and 109.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 07:51:53,229 INFO L158 Benchmark]: TraceAbstraction took 2530.25ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 109.0MB in the beginning and 144.9MB in the end (delta: -35.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-11-16 07:51:53,230 INFO L158 Benchmark]: Witness Printer took 74.14ms. Allocated memory is still 209.7MB. Free memory was 144.9MB in the beginning and 140.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:51:53,231 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.16ms. Allocated memory is still 113.2MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.90ms. Allocated memory is still 161.5MB. Free memory was 90.7MB in the beginning and 131.4MB in the end (delta: -40.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.18ms. Allocated memory is still 161.5MB. Free memory was 131.4MB in the beginning and 129.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 489.95ms. Allocated memory is still 161.5MB. Free memory was 127.3MB in the beginning and 109.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2530.25ms. Allocated memory was 161.5MB in the beginning and 209.7MB in the end (delta: 48.2MB). Free memory was 109.0MB in the beginning and 144.9MB in the end (delta: -35.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Witness Printer took 74.14ms. Allocated memory is still 209.7MB. Free memory was 144.9MB in the beginning and 140.7MB 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] - GenericResultAtLocation [Line: 186]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [186] - GenericResultAtLocation [Line: 256]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [256] - GenericResultAtLocation [Line: 426]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [426] - GenericResultAtLocation [Line: 464]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [464] - GenericResultAtLocation [Line: 560]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [560] * 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: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L260] int pumpRunning = 0; [L261] int systemActive = 1; [L465] int cleanupTimeShifts = 4; [L730] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L538] int retValue_acc ; [L539] int tmp ; [L543] FCALL select_helpers() [L544] FCALL select_features() [L545] CALL, EXPR valid_product() [L456] int retValue_acc ; [L459] retValue_acc = 1 [L460] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L545] RET, EXPR valid_product() [L545] tmp = valid_product() [L547] COND TRUE \read(tmp) [L549] FCALL setup() [L550] CALL runTest() [L532] CALL test() [L191] int splverifierCounter ; [L192] int tmp ; [L193] int tmp___0 ; [L194] int tmp___1 ; [L195] int tmp___2 ; [L198] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L200] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L202] COND TRUE splverifierCounter < 4 [L208] tmp = __VERIFIER_nondet_int() [L210] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L212] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L75] COND TRUE waterLevel < 2 [L76] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L212] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L218] tmp___0 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L222] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L87] COND FALSE !(\read(methaneLevelCritical)) [L90] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L222] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L228] tmp___2 = __VERIFIER_nondet_int() [L230] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L245] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L267] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L274] COND TRUE \read(systemActive) [L276] CALL processEnvironment() [L296] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L299] COND TRUE ! pumpRunning [L301] CALL, EXPR isHighWaterLevel() [L393] int retValue_acc ; [L394] int tmp ; [L395] int tmp___0 ; [L399] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(waterLevel < 2) [L144] retValue_acc = 0 [L145] 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] [L399] RET, EXPR isHighWaterSensorDry() [L399] tmp = isHighWaterSensorDry() [L401] COND FALSE !(\read(tmp)) [L404] 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] [L406] retValue_acc = tmp___0 [L407] 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] [L301] RET, EXPR isHighWaterLevel() [L301] tmp = isHighWaterLevel() [L303] COND TRUE \read(tmp) [L305] CALL activatePump() [L324] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L305] RET activatePump() [L276] RET processEnvironment() [L282] CALL __utac_acc__Specification1_spec__1() [L162] int tmp ; [L163] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L167] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] 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] [L167] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L167] tmp = isMethaneLevelCritical() [L169] COND TRUE \read(tmp) [L171] CALL, EXPR isPumpRunning() [L348] int retValue_acc ; [L351] retValue_acc = pumpRunning [L352] 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] [L171] RET, EXPR isPumpRunning() [L171] tmp___0 = isPumpRunning() [L173] COND TRUE \read(tmp___0) [L175] CALL __automaton_fail() [L155] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 467 mSDsluCounter, 2121 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1410 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 711 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=9, InterpolantAutomatonStates: 44, 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, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 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:51:53,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE