./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.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 87e1d1b45ecae6206db87e264fd33705b608c5376aceaefe9ff79eccaaf25b96 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:09:54,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:09:54,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:09:54,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:09:54,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:09:54,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:09:54,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:09:54,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:09:54,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:09:54,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:09:54,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:09:54,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:09:54,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:09:54,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:09:54,111 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:09:54,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:09:54,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:09:54,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:09:54,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:09:54,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:09:54,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:09:54,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:09:54,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:54,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:09:54,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:09:54,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:09:54,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:09:54,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:09:54,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:09:54,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:09:54,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:09:54,120 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 -> 87e1d1b45ecae6206db87e264fd33705b608c5376aceaefe9ff79eccaaf25b96 [2024-10-14 03:09:54,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:09:54,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:09:54,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:09:54,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:09:54,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:09:54,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2024-10-14 03:09:55,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:09:55,665 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:09:55,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2024-10-14 03:09:55,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be66ad8e8/28ee03aa07a8491f8be6ced0b501b74b/FLAG828994f7b [2024-10-14 03:09:55,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be66ad8e8/28ee03aa07a8491f8be6ced0b501b74b [2024-10-14 03:09:55,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:09:55,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:09:55,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:55,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:09:55,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:09:55,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:55" (1/1) ... [2024-10-14 03:09:55,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ece53ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:55, skipping insertion in model container [2024-10-14 03:09:55,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:55" (1/1) ... [2024-10-14 03:09:55,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:09:55,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c[15496,15509] [2024-10-14 03:09:55,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:55,958 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:09:55,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [87] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [453] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [525] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [727] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [736] [2024-10-14 03:09:55,967 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [831] [2024-10-14 03:09:55,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [927] [2024-10-14 03:09:55,997 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c[15496,15509] [2024-10-14 03:09:56,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:56,027 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:09:56,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56 WrapperNode [2024-10-14 03:09:56,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:56,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:56,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:09:56,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:09:56,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,079 INFO L138 Inliner]: procedures = 54, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 201 [2024-10-14 03:09:56,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:56,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:09:56,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:09:56,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:09:56,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:09:56,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:09:56,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:09:56,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:09:56,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:09:56,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:56,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:09:56,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:09:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:09:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:09:56,188 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:09:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:09:56,188 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:09:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:09:56,188 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:09:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:56,189 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:09:56,189 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:09:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-14 03:09:56,190 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-14 03:09:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:09:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:09:56,190 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:09:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:09:56,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:09:56,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:09:56,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:09:56,423 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-14 03:09:56,424 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:09:56,468 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:09:56,468 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:09:56,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:56 BoogieIcfgContainer [2024-10-14 03:09:56,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:09:56,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:09:56,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:09:56,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:09:56,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:09:55" (1/3) ... [2024-10-14 03:09:56,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfeb220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:56, skipping insertion in model container [2024-10-14 03:09:56,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (2/3) ... [2024-10-14 03:09:56,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfeb220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:56, skipping insertion in model container [2024-10-14 03:09:56,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:56" (3/3) ... [2024-10-14 03:09:56,477 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product39.cil.c [2024-10-14 03:09:56,490 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:09:56,490 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:09:56,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:09:56,543 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;@1a14eb1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:09:56,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:09:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 46 states have (on average 1.565217391304348) internal successors, (72), 55 states have internal predecessors, (72), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 03:09:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 03:09:56,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:56,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:56,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:56,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash 642103122, now seen corresponding path program 1 times [2024-10-14 03:09:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539782340] [2024-10-14 03:09:56,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:56,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:56,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539782340] [2024-10-14 03:09:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539782340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:56,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675364838] [2024-10-14 03:09:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:56,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:09:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:09:56,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:56,805 INFO L87 Difference]: Start difference. First operand has 67 states, 46 states have (on average 1.565217391304348) internal successors, (72), 55 states have internal predecessors, (72), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:56,862 INFO L93 Difference]: Finished difference Result 132 states and 193 transitions. [2024-10-14 03:09:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:09:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 03:09:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:56,871 INFO L225 Difference]: With dead ends: 132 [2024-10-14 03:09:56,872 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 03:09:56,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:56,876 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:56,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 03:09:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 03:09:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:09:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-10-14 03:09:56,910 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 12 [2024-10-14 03:09:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:56,910 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-10-14 03:09:56,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-10-14 03:09:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 03:09:56,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:56,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:09:56,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -515998868, now seen corresponding path program 1 times [2024-10-14 03:09:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910467749] [2024-10-14 03:09:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910467749] [2024-10-14 03:09:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910467749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:56,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355021070] [2024-10-14 03:09:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:56,990 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,022 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2024-10-14 03:09:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 03:09:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,023 INFO L225 Difference]: With dead ends: 94 [2024-10-14 03:09:57,023 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 03:09:57,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:57,026 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 03:09:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 03:09:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 46 states have internal predecessors, (56), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:09:57,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-10-14 03:09:57,037 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 13 [2024-10-14 03:09:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-10-14 03:09:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-10-14 03:09:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:09:57,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:09:57,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -606653813, now seen corresponding path program 1 times [2024-10-14 03:09:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251298578] [2024-10-14 03:09:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251298578] [2024-10-14 03:09:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251298578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:57,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719965133] [2024-10-14 03:09:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:57,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:57,122 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,172 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-10-14 03:09:57,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 03:09:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,174 INFO L225 Difference]: With dead ends: 158 [2024-10-14 03:09:57,174 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 03:09:57,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:57,175 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 61 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 03:09:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-14 03:09:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 87 states have internal predecessors, (107), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 11 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 03:09:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2024-10-14 03:09:57,188 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 16 [2024-10-14 03:09:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2024-10-14 03:09:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2024-10-14 03:09:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 03:09:57,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:09:57,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2136556442, now seen corresponding path program 1 times [2024-10-14 03:09:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159067542] [2024-10-14 03:09:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159067542] [2024-10-14 03:09:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159067542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3359050] [2024-10-14 03:09:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:09:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:09:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:09:57,267 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,331 INFO L93 Difference]: Finished difference Result 270 states and 385 transitions. [2024-10-14 03:09:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:09:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 03:09:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,333 INFO L225 Difference]: With dead ends: 270 [2024-10-14 03:09:57,333 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 03:09:57,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:57,335 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 168 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 03:09:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2024-10-14 03:09:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 136 states have internal predecessors, (171), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (32), 21 states have call predecessors, (32), 24 states have call successors, (32) [2024-10-14 03:09:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions. [2024-10-14 03:09:57,356 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 19 [2024-10-14 03:09:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,356 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions. [2024-10-14 03:09:57,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions. [2024-10-14 03:09:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:57,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,357 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-10-14 03:09:57,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:09:57,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 581883123, now seen corresponding path program 1 times [2024-10-14 03:09:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117227641] [2024-10-14 03:09:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117227641] [2024-10-14 03:09:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117227641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263716722] [2024-10-14 03:09:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:57,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:57,439 INFO L87 Difference]: Start difference. First operand 168 states and 227 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,560 INFO L93 Difference]: Finished difference Result 368 states and 501 transitions. [2024-10-14 03:09:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:09:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:09:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,562 INFO L225 Difference]: With dead ends: 368 [2024-10-14 03:09:57,564 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 03:09:57,565 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-10-14 03:09:57,566 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 03:09:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-14 03:09:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.380952380952381) internal successors, (203), 162 states have internal predecessors, (203), 24 states have call successors, (24), 22 states have call predecessors, (24), 28 states have return successors, (38), 25 states have call predecessors, (38), 24 states have call successors, (38) [2024-10-14 03:09:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 265 transitions. [2024-10-14 03:09:57,612 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 265 transitions. Word has length 28 [2024-10-14 03:09:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 265 transitions. [2024-10-14 03:09:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 265 transitions. [2024-10-14 03:09:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:57,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,614 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-10-14 03:09:57,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:09:57,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 188856113, now seen corresponding path program 1 times [2024-10-14 03:09:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707960902] [2024-10-14 03:09:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707960902] [2024-10-14 03:09:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707960902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:57,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111303746] [2024-10-14 03:09:57,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:57,715 INFO L87 Difference]: Start difference. First operand 200 states and 265 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,909 INFO L93 Difference]: Finished difference Result 410 states and 555 transitions. [2024-10-14 03:09:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:09:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-10-14 03:09:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,911 INFO L225 Difference]: With dead ends: 410 [2024-10-14 03:09:57,911 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 03:09:57,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:09:57,912 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:57,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 223 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 03:09:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2024-10-14 03:09:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 166 states have internal predecessors, (207), 24 states have call successors, (24), 22 states have call predecessors, (24), 28 states have return successors, (38), 25 states have call predecessors, (38), 24 states have call successors, (38) [2024-10-14 03:09:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2024-10-14 03:09:57,927 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 28 [2024-10-14 03:09:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,928 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2024-10-14 03:09:57,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2024-10-14 03:09:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:57,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,929 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-10-14 03:09:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:09:57,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,931 INFO L85 PathProgramCache]: Analyzing trace with hash 447021551, now seen corresponding path program 1 times [2024-10-14 03:09:57,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487657305] [2024-10-14 03:09:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487657305] [2024-10-14 03:09:57,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487657305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990333042] [2024-10-14 03:09:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:57,996 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,199 INFO L93 Difference]: Finished difference Result 675 states and 970 transitions. [2024-10-14 03:09:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:09:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,202 INFO L225 Difference]: With dead ends: 675 [2024-10-14 03:09:58,202 INFO L226 Difference]: Without dead ends: 473 [2024-10-14 03:09:58,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:58,203 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 159 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 236 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-14 03:09:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 465. [2024-10-14 03:09:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 343 states have (on average 1.358600583090379) internal successors, (466), 372 states have internal predecessors, (466), 63 states have call successors, (63), 59 states have call predecessors, (63), 58 states have return successors, (113), 57 states have call predecessors, (113), 63 states have call successors, (113) [2024-10-14 03:09:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 642 transitions. [2024-10-14 03:09:58,234 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 642 transitions. Word has length 28 [2024-10-14 03:09:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,235 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 642 transitions. [2024-10-14 03:09:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 642 transitions. [2024-10-14 03:09:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:09:58,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,236 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] [2024-10-14 03:09:58,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:09:58,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2090782315, now seen corresponding path program 1 times [2024-10-14 03:09:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412824854] [2024-10-14 03:09:58,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:09:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412824854] [2024-10-14 03:09:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412824854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427489564] [2024-10-14 03:09:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:58,347 INFO L87 Difference]: Start difference. First operand 465 states and 642 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:09:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,644 INFO L93 Difference]: Finished difference Result 998 states and 1402 transitions. [2024-10-14 03:09:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:09:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 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 32 [2024-10-14 03:09:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,651 INFO L225 Difference]: With dead ends: 998 [2024-10-14 03:09:58,651 INFO L226 Difference]: Without dead ends: 535 [2024-10-14 03:09:58,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:09:58,653 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 140 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 226 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-14 03:09:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2024-10-14 03:09:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 393 states have (on average 1.3307888040712468) internal successors, (523), 430 states have internal predecessors, (523), 71 states have call successors, (71), 59 states have call predecessors, (71), 68 states have return successors, (143), 67 states have call predecessors, (143), 71 states have call successors, (143) [2024-10-14 03:09:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 737 transitions. [2024-10-14 03:09:58,694 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 737 transitions. Word has length 32 [2024-10-14 03:09:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,695 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 737 transitions. [2024-10-14 03:09:58,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:09:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 737 transitions. [2024-10-14 03:09:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:09:58,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:58,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:09:58,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -285086337, now seen corresponding path program 1 times [2024-10-14 03:09:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541745417] [2024-10-14 03:09:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:09:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:09:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541745417] [2024-10-14 03:09:58,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541745417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:09:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641564648] [2024-10-14 03:09:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:09:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:09:58,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:09:58,775 INFO L87 Difference]: Start difference. First operand 533 states and 737 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:09:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,978 INFO L93 Difference]: Finished difference Result 622 states and 854 transitions. [2024-10-14 03:09:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:09:58,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-10-14 03:09:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,980 INFO L225 Difference]: With dead ends: 622 [2024-10-14 03:09:58,981 INFO L226 Difference]: Without dead ends: 259 [2024-10-14 03:09:58,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:09:58,982 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 158 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 197 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-14 03:09:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-10-14 03:09:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 206 states have internal predecessors, (243), 33 states have call successors, (33), 29 states have call predecessors, (33), 33 states have return successors, (68), 32 states have call predecessors, (68), 33 states have call successors, (68) [2024-10-14 03:09:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 344 transitions. [2024-10-14 03:09:59,002 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 344 transitions. Word has length 51 [2024-10-14 03:09:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:59,002 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 344 transitions. [2024-10-14 03:09:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:09:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 344 transitions. [2024-10-14 03:09:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:09:59,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:59,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:09:59,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 464611095, now seen corresponding path program 1 times [2024-10-14 03:09:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044306232] [2024-10-14 03:09:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:09:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:09:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 03:09:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:09:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:09:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:59,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044306232] [2024-10-14 03:09:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044306232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:09:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985024969] [2024-10-14 03:09:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:09:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:59,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:09:59,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:09:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:09:59,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:09:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:09:59,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:09:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:09:59,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985024969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:09:59,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:09:59,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-14 03:09:59,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308235960] [2024-10-14 03:09:59,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:09:59,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:09:59,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:09:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:09:59,380 INFO L87 Difference]: Start difference. First operand 257 states and 344 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:09:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:59,740 INFO L93 Difference]: Finished difference Result 653 states and 906 transitions. [2024-10-14 03:09:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:09:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 03:09:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:59,743 INFO L225 Difference]: With dead ends: 653 [2024-10-14 03:09:59,743 INFO L226 Difference]: Without dead ends: 398 [2024-10-14 03:09:59,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:09:59,745 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 215 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:59,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 229 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:09:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-14 03:09:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 367. [2024-10-14 03:09:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 292 states have internal predecessors, (342), 49 states have call successors, (49), 44 states have call predecessors, (49), 47 states have return successors, (102), 44 states have call predecessors, (102), 49 states have call successors, (102) [2024-10-14 03:09:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 493 transitions. [2024-10-14 03:09:59,769 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 493 transitions. Word has length 59 [2024-10-14 03:09:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 493 transitions. [2024-10-14 03:09:59,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:09:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 493 transitions. [2024-10-14 03:09:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:09:59,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:59,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:59,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:09:59,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:09:59,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1645072469, now seen corresponding path program 2 times [2024-10-14 03:09:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799581015] [2024-10-14 03:09:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:09:59,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:09:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:10:00,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:10:00,027 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:10:00,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:10:00,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:10:00,032 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:00,096 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:10:00,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:10:00 BoogieIcfgContainer [2024-10-14 03:10:00,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:10:00,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:10:00,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:10:00,102 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:10:00,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:56" (3/4) ... [2024-10-14 03:10:00,103 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:10:00,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:10:00,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:10:00,172 INFO L158 Benchmark]: Toolchain (without parser) took 4482.13ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 147.3MB in the beginning and 93.0MB in the end (delta: 54.3MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,172 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:10:00,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.67ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 130.4MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.55ms. Allocated memory is still 178.3MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,172 INFO L158 Benchmark]: Boogie Preprocessor took 31.88ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,172 INFO L158 Benchmark]: RCFGBuilder took 356.58ms. Allocated memory is still 178.3MB. Free memory was 125.7MB in the beginning and 102.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,173 INFO L158 Benchmark]: TraceAbstraction took 3631.35ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,173 INFO L158 Benchmark]: Witness Printer took 69.52ms. Allocated memory is still 239.1MB. Free memory was 100.3MB in the beginning and 93.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:10:00,175 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.12ms. Allocated memory is still 127.9MB. Free memory is still 90.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.67ms. Allocated memory is still 178.3MB. Free memory was 150.1MB in the beginning and 130.4MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.55ms. Allocated memory is still 178.3MB. Free memory was 129.9MB in the beginning and 127.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.88ms. Allocated memory is still 178.3MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.58ms. Allocated memory is still 178.3MB. Free memory was 125.7MB in the beginning and 102.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3631.35ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * Witness Printer took 69.52ms. Allocated memory is still 239.1MB. Free memory was 100.3MB in the beginning and 93.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [87] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [453] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [525] - GenericResultAtLocation [Line: 727]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [727] - GenericResultAtLocation [Line: 736]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [736] - GenericResultAtLocation [Line: 831]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [831] - GenericResultAtLocation [Line: 927]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [927] * 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: 732]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L257] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L534] int pumpRunning = 0; [L535] int systemActive = 1; [L738] int waterLevel = 1; [L739] int methaneLevelCritical = 0; [L832] int cleanupTimeShifts = 4; [L905] int retValue_acc ; [L906] int tmp ; [L910] FCALL select_helpers() [L911] FCALL select_features() [L912] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); [L912] RET, EXPR valid_product() [L912] tmp = valid_product() [L914] COND TRUE \read(tmp) [L916] FCALL setup() [L917] CALL runTest() [L899] CALL test() [L460] int splverifierCounter ; [L461] int tmp ; [L462] int tmp___0 ; [L463] int tmp___1 ; [L464] int tmp___2 ; [L467] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L469] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L471] COND TRUE splverifierCounter < 4 [L477] tmp = __VERIFIER_nondet_int() [L479] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L481] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L756] COND TRUE waterLevel < 2 [L757] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L481] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L487] tmp___0 = __VERIFIER_nondet_int() [L489] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L497] tmp___2 = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L514] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L542] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L549] COND TRUE \read(systemActive) [L551] CALL processEnvironment() [L597] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L600] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L615] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L571] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L574] COND TRUE ! pumpRunning [L576] CALL, EXPR isHighWaterLevel() [L694] int retValue_acc ; [L695] int tmp ; [L696] int tmp___0 ; [L700] CALL, EXPR isHighWaterSensorDry() [L818] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L821] COND FALSE !(waterLevel < 2) [L825] retValue_acc = 0 [L826] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L700] RET, EXPR isHighWaterSensorDry() [L700] tmp = isHighWaterSensorDry() [L702] COND FALSE !(\read(tmp)) [L705] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L707] retValue_acc = tmp___0 [L708] return (retValue_acc); [L576] RET, EXPR isHighWaterLevel() [L576] tmp = isHighWaterLevel() [L578] COND TRUE \read(tmp) [L580] CALL activatePump() [L625] pumpRunning = 1 [L580] RET activatePump() [L615] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L551] RET processEnvironment() [L557] CALL __utac_acc__Specification4_spec__1() [L929] int tmp ; [L930] int tmp___0 ; [L934] CALL, EXPR getWaterLevel() [L809] int retValue_acc ; [L812] retValue_acc = waterLevel [L813] return (retValue_acc); [L934] RET, EXPR getWaterLevel() [L934] tmp = getWaterLevel() [L936] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L557] RET __utac_acc__Specification4_spec__1() [L514] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L469] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L471] COND TRUE splverifierCounter < 4 [L477] tmp = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L487] tmp___0 = __VERIFIER_nondet_int() [L489] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L497] tmp___2 = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L514] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L542] COND TRUE \read(pumpRunning) [L544] CALL lowerWaterLevel() [L744] COND TRUE waterLevel > 0 [L745] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L544] RET lowerWaterLevel() [L549] COND TRUE \read(systemActive) [L551] CALL processEnvironment() [L597] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L600] COND TRUE \read(pumpRunning) [L602] CALL, EXPR isMethaneAlarm() [L638] int retValue_acc ; [L642] CALL, EXPR isMethaneLevelCritical() [L777] int retValue_acc ; [L780] retValue_acc = methaneLevelCritical [L781] return (retValue_acc); [L642] RET, EXPR isMethaneLevelCritical() [L642] retValue_acc = isMethaneLevelCritical() [L644] return (retValue_acc); [L602] RET, EXPR isMethaneAlarm() [L602] tmp = isMethaneAlarm() [L604] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L610] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L571] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L574] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L589] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L610] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L551] RET processEnvironment() [L557] CALL __utac_acc__Specification4_spec__1() [L929] int tmp ; [L930] int tmp___0 ; [L934] CALL, EXPR getWaterLevel() [L809] int retValue_acc ; [L812] retValue_acc = waterLevel [L813] return (retValue_acc); [L934] RET, EXPR getWaterLevel() [L934] tmp = getWaterLevel() [L936] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L557] RET __utac_acc__Specification4_spec__1() [L514] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L469] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L471] COND TRUE splverifierCounter < 4 [L477] tmp = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L487] tmp___0 = __VERIFIER_nondet_int() [L489] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L497] tmp___2 = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L514] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L542] COND TRUE \read(pumpRunning) [L544] CALL lowerWaterLevel() [L744] COND TRUE waterLevel > 0 [L745] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L544] RET lowerWaterLevel() [L549] COND TRUE \read(systemActive) [L551] CALL processEnvironment() [L597] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L600] COND TRUE \read(pumpRunning) [L602] CALL, EXPR isMethaneAlarm() [L638] int retValue_acc ; [L642] CALL, EXPR isMethaneLevelCritical() [L777] int retValue_acc ; [L780] retValue_acc = methaneLevelCritical [L781] return (retValue_acc); [L642] RET, EXPR isMethaneLevelCritical() [L642] retValue_acc = isMethaneLevelCritical() [L644] return (retValue_acc); [L602] RET, EXPR isMethaneAlarm() [L602] tmp = isMethaneAlarm() [L604] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L610] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L571] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L574] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L589] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L610] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L551] RET processEnvironment() [L557] CALL __utac_acc__Specification4_spec__1() [L929] int tmp ; [L930] int tmp___0 ; [L934] CALL, EXPR getWaterLevel() [L809] int retValue_acc ; [L812] retValue_acc = waterLevel [L813] return (retValue_acc); [L934] RET, EXPR getWaterLevel() [L934] tmp = getWaterLevel() [L936] COND TRUE tmp == 0 [L938] CALL, EXPR isPumpRunning() [L649] int retValue_acc ; [L652] retValue_acc = pumpRunning [L653] return (retValue_acc); [L938] RET, EXPR isPumpRunning() [L938] tmp___0 = isPumpRunning() [L940] COND TRUE \read(tmp___0) [L942] CALL __automaton_fail() [L732] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 978 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 951 mSDsluCounter, 1759 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1103 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 656 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 57 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 2 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 50/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 03:10:00,206 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