./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 90a76a2882b85be994db917b0e3084e326cc29272a09018948be7f2d57c03e00 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:57:54,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:57:54,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:57:54,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:57:54,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:57:54,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:57:54,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:57:54,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:57:54,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:57:54,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:57:54,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:57:54,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:57:54,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:57:54,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:57:54,243 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:57:54,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:57:54,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:57:54,244 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:57:54,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:57:54,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:57:54,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:57:54,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:57:54,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:57:54,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:57:54,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:57:54,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:57:54,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:57:54,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:57:54,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:57:54,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:57:54,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:57:54,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:57:54,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:57:54,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:57:54,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:57:54,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:57:54,258 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-clean/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-clean/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 -> 90a76a2882b85be994db917b0e3084e326cc29272a09018948be7f2d57c03e00 [2024-10-11 02:57:54,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:57:54,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:57:54,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:57:54,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:57:54,503 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:57:54,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2024-10-11 02:57:55,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:57:55,882 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:57:55,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c [2024-10-11 02:57:55,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25d9f804c/a0d2a3e61c4f4c1381c3feeafd144ed0/FLAGf290b323b [2024-10-11 02:57:55,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25d9f804c/a0d2a3e61c4f4c1381c3feeafd144ed0 [2024-10-11 02:57:55,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:57:55,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:57:55,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:57:55,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:57:55,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:57:55,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:55" (1/1) ... [2024-10-11 02:57:55,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e539760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:55, skipping insertion in model container [2024-10-11 02:57:55,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:55" (1/1) ... [2024-10-11 02:57:55,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:57:56,121 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c[3816,3829] [2024-10-11 02:57:56,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:57:56,197 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:57:56,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-10-11 02:57:56,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [221] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [230] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [470] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [505] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [531] [2024-10-11 02:57:56,206 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [897] [2024-10-11 02:57:56,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product54.cil.c[3816,3829] [2024-10-11 02:57:56,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:57:56,285 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:57:56,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56 WrapperNode [2024-10-11 02:57:56,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:57:56,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:57:56,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:57:56,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:57:56,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,331 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 219 [2024-10-11 02:57:56,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:57:56,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:57:56,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:57:56,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:57:56,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,371 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-11 02:57:56,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:57:56,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:57:56,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:57:56,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:57:56,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (1/1) ... [2024-10-11 02:57:56,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:57:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:57:56,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:57:56,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:57:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:57:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:57:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:57:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:57:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:57:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:57:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:57:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:57:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:57:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:57:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:57:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:57:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:57:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-11 02:57:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-11 02:57:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 02:57:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 02:57:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:57:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:57:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:57:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:57:56,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:57:56,554 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:57:56,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:57:56,796 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 02:57:56,797 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:57:56,841 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:57:56,841 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:57:56,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:56 BoogieIcfgContainer [2024-10-11 02:57:56,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:57:56,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:57:56,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:57:56,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:57:56,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:57:55" (1/3) ... [2024-10-11 02:57:56,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28140ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:56, skipping insertion in model container [2024-10-11 02:57:56,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:56" (2/3) ... [2024-10-11 02:57:56,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28140ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:56, skipping insertion in model container [2024-10-11 02:57:56,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:56" (3/3) ... [2024-10-11 02:57:56,852 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product54.cil.c [2024-10-11 02:57:56,864 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:57:56,864 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:57:56,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:57:56,923 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;@4cb266e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:57:56,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:57:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.528301886792453) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 02:57:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 02:57:56,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:56,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:56,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1629111539, now seen corresponding path program 1 times [2024-10-11 02:57:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:56,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695880515] [2024-10-11 02:57:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:56,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:57:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,094 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-11 02:57:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695880515] [2024-10-11 02:57:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695880515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:57:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564212547] [2024-10-11 02:57:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:57,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:57:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:57,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:57:57,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:57:57,121 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.528301886792453) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:57,171 INFO L93 Difference]: Finished difference Result 158 states and 227 transitions. [2024-10-11 02:57:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:57:57,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 02:57:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:57,182 INFO L225 Difference]: With dead ends: 158 [2024-10-11 02:57:57,182 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 02:57:57,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:57:57,187 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:57,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:57:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 02:57:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 02:57:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.42) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 02:57:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2024-10-11 02:57:57,229 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 16 [2024-10-11 02:57:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:57,230 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2024-10-11 02:57:57,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2024-10-11 02:57:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:57:57,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:57,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:57,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:57:57,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:57,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1591000245, now seen corresponding path program 1 times [2024-10-11 02:57:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:57,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464380984] [2024-10-11 02:57:57,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:57:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,322 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-11 02:57:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464380984] [2024-10-11 02:57:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464380984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:57:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443430519] [2024-10-11 02:57:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:57:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:57,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:57:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:57,326 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:57,368 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2024-10-11 02:57:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:57:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 02:57:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:57,370 INFO L225 Difference]: With dead ends: 123 [2024-10-11 02:57:57,370 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 02:57:57,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:57,371 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:57,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:57:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 02:57:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 02:57:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 02:57:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 91 transitions. [2024-10-11 02:57:57,383 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 91 transitions. Word has length 17 [2024-10-11 02:57:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:57,384 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 91 transitions. [2024-10-11 02:57:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 91 transitions. [2024-10-11 02:57:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 02:57:57,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:57,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:57,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:57:57,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -571860815, now seen corresponding path program 1 times [2024-10-11 02:57:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026707276] [2024-10-11 02:57:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,481 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-11 02:57:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:57,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026707276] [2024-10-11 02:57:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026707276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:57:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110847554] [2024-10-11 02:57:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:57:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:57,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:57:57,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:57,483 INFO L87 Difference]: Start difference. First operand 67 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:57,525 INFO L93 Difference]: Finished difference Result 132 states and 181 transitions. [2024-10-11 02:57:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:57:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 02:57:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:57,528 INFO L225 Difference]: With dead ends: 132 [2024-10-11 02:57:57,528 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 02:57:57,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:57,530 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:57,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:57:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 02:57:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 02:57:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 54 states have internal predecessors, (64), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 02:57:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-10-11 02:57:57,541 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 20 [2024-10-11 02:57:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:57,541 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-10-11 02:57:57,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-10-11 02:57:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 02:57:57,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:57,542 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:57:57,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:57,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1018575888, now seen corresponding path program 1 times [2024-10-11 02:57:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:57,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755074643] [2024-10-11 02:57:57,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 02:57:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:57:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:57:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755074643] [2024-10-11 02:57:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755074643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:57:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234979955] [2024-10-11 02:57:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:57:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:57:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:57:57,640 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:57:57,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:57,823 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2024-10-11 02:57:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:57:57,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 02:57:57,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:57,826 INFO L225 Difference]: With dead ends: 200 [2024-10-11 02:57:57,827 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 02:57:57,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11 02:57:57,831 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 126 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:57,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 142 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 02:57:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2024-10-11 02:57:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.348314606741573) internal successors, (120), 97 states have internal predecessors, (120), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-11 02:57:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2024-10-11 02:57:57,857 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 30 [2024-10-11 02:57:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:57,858 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2024-10-11 02:57:57,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:57:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2024-10-11 02:57:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:57:57,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:57,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:57,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:57:57,860 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -829358918, now seen corresponding path program 1 times [2024-10-11 02:57:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329252948] [2024-10-11 02:57:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:57:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:57,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-11 02:57:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329252948] [2024-10-11 02:57:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329252948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:57,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:57:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415308548] [2024-10-11 02:57:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:57,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:57:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:57:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:57:57,988 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:57:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:58,127 INFO L93 Difference]: Finished difference Result 260 states and 346 transitions. [2024-10-11 02:57:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:57:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 02:57:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:58,130 INFO L225 Difference]: With dead ends: 260 [2024-10-11 02:57:58,130 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 02:57:58,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11 02:57:58,131 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 50 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:58,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 215 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 02:57:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-10-11 02:57:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 99 states have internal predecessors, (122), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-11 02:57:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2024-10-11 02:57:58,156 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 37 [2024-10-11 02:57:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2024-10-11 02:57:58,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:57:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2024-10-11 02:57:58,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:57:58,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:58,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:57:58,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:58,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1850427272, now seen corresponding path program 1 times [2024-10-11 02:57:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358366214] [2024-10-11 02:57:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:57:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,261 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-11 02:57:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358366214] [2024-10-11 02:57:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358366214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:57:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706610150] [2024-10-11 02:57:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:57:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:57:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:57:58,262 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:57:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:58,427 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2024-10-11 02:57:58,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:57:58,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 02:57:58,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:58,429 INFO L225 Difference]: With dead ends: 264 [2024-10-11 02:57:58,429 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 02:57:58,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:57:58,430 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:58,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 197 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 02:57:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-11 02:57:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 101 states have internal predecessors, (124), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-11 02:57:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 173 transitions. [2024-10-11 02:57:58,449 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 173 transitions. Word has length 37 [2024-10-11 02:57:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 173 transitions. [2024-10-11 02:57:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:57:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2024-10-11 02:57:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:57:58,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:58,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:57:58,462 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 450395318, now seen corresponding path program 1 times [2024-10-11 02:57:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619865363] [2024-10-11 02:57:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:57:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,541 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-11 02:57:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619865363] [2024-10-11 02:57:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619865363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:58,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:58,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:57:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155003894] [2024-10-11 02:57:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:58,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:57:58,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:57:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:57:58,543 INFO L87 Difference]: Start difference. First operand 133 states and 173 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:57:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:58,740 INFO L93 Difference]: Finished difference Result 385 states and 519 transitions. [2024-10-11 02:57:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:57:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-10-11 02:57:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:58,743 INFO L225 Difference]: With dead ends: 385 [2024-10-11 02:57:58,743 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 02:57:58,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:57:58,748 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 189 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:58,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 223 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:57:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 02:57:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2024-10-11 02:57:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 185 states have internal predecessors, (224), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-10-11 02:57:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 322 transitions. [2024-10-11 02:57:58,779 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 322 transitions. Word has length 37 [2024-10-11 02:57:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 322 transitions. [2024-10-11 02:57:58,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:57:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 322 transitions. [2024-10-11 02:57:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 02:57:58,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:58,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:58,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:57:58,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:58,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash 134604755, now seen corresponding path program 1 times [2024-10-11 02:57:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:58,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036557856] [2024-10-11 02:57:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:57:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:57:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:58,879 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-11 02:57:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:58,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036557856] [2024-10-11 02:57:58,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036557856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:57:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986553799] [2024-10-11 02:57:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:57:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:57:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:57:58,884 INFO L87 Difference]: Start difference. First operand 246 states and 322 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:57:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:59,027 INFO L93 Difference]: Finished difference Result 250 states and 324 transitions. [2024-10-11 02:57:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:57:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-10-11 02:57:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:59,029 INFO L225 Difference]: With dead ends: 250 [2024-10-11 02:57:59,029 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 02:57:59,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:57:59,030 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 104 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:59,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 174 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 02:57:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2024-10-11 02:57:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 185 states have internal predecessors, (220), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-10-11 02:57:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2024-10-11 02:57:59,048 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 40 [2024-10-11 02:57:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:59,049 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2024-10-11 02:57:59,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:57:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2024-10-11 02:57:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 02:57:59,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:59,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:57:59,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:59,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:59,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1357831856, now seen corresponding path program 1 times [2024-10-11 02:57:59,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:59,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167074057] [2024-10-11 02:57:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:57:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:59,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:57:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:59,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:57:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:59,146 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-11 02:57:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167074057] [2024-10-11 02:57:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167074057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:57:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282533587] [2024-10-11 02:57:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:57:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:57:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:57:59,147 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:57:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:59,568 INFO L93 Difference]: Finished difference Result 829 states and 1115 transitions. [2024-10-11 02:57:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:57:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-11 02:57:59,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:59,571 INFO L225 Difference]: With dead ends: 829 [2024-10-11 02:57:59,571 INFO L226 Difference]: Without dead ends: 585 [2024-10-11 02:57:59,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:57:59,572 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 268 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:59,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 219 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:57:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-10-11 02:57:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 564. [2024-10-11 02:57:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 393 states have (on average 1.2315521628498727) internal successors, (484), 424 states have internal predecessors, (484), 88 states have call successors, (88), 66 states have call predecessors, (88), 82 states have return successors, (167), 92 states have call predecessors, (167), 88 states have call successors, (167) [2024-10-11 02:57:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 739 transitions. [2024-10-11 02:57:59,610 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 739 transitions. Word has length 41 [2024-10-11 02:57:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:59,610 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 739 transitions. [2024-10-11 02:57:59,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:57:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 739 transitions. [2024-10-11 02:57:59,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 02:57:59,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:59,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:59,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:57:59,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:59,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2063111284, now seen corresponding path program 1 times [2024-10-11 02:57:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757924078] [2024-10-11 02:57:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:57:59,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:57:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:57:59,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:57:59,648 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:57:59,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:57:59,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:57:59,651 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:59,688 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:57:59,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:57:59 BoogieIcfgContainer [2024-10-11 02:57:59,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:57:59,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:57:59,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:57:59,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:57:59,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:56" (3/4) ... [2024-10-11 02:57:59,692 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:57:59,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:57:59,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:57:59,743 INFO L158 Benchmark]: Toolchain (without parser) took 3824.82ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 151.8MB in the beginning and 83.3MB in the end (delta: 68.4MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,744 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:57:59,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.37ms. Allocated memory is still 180.4MB. Free memory was 151.8MB in the beginning and 130.0MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.43ms. Allocated memory is still 180.4MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,744 INFO L158 Benchmark]: Boogie Preprocessor took 55.14ms. Allocated memory is still 180.4MB. Free memory was 127.9MB 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-11 02:57:59,744 INFO L158 Benchmark]: RCFGBuilder took 452.11ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 128.5MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,744 INFO L158 Benchmark]: TraceAbstraction took 2844.52ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 127.6MB in the beginning and 87.5MB in the end (delta: 40.1MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,745 INFO L158 Benchmark]: Witness Printer took 52.50ms. Allocated memory is still 218.1MB. Free memory was 87.5MB in the beginning and 83.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:57:59,745 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.14ms. Allocated memory is still 180.4MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.37ms. Allocated memory is still 180.4MB. Free memory was 151.8MB in the beginning and 130.0MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.43ms. Allocated memory is still 180.4MB. Free memory was 130.0MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.14ms. Allocated memory is still 180.4MB. Free memory was 127.9MB 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 452.11ms. Allocated memory is still 180.4MB. Free memory was 125.7MB in the beginning and 128.5MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2844.52ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 127.6MB in the beginning and 87.5MB in the end (delta: 40.1MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Witness Printer took 52.50ms. Allocated memory is still 218.1MB. Free memory was 87.5MB in the beginning and 83.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [221] - GenericResultAtLocation [Line: 230]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [230] - GenericResultAtLocation [Line: 470]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [470] - GenericResultAtLocation [Line: 505]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [505] - GenericResultAtLocation [Line: 531]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [531] - GenericResultAtLocation [Line: 897]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [897] * 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: 226]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L50] int cleanupTimeShifts = 4; [L239] int pumpRunning = 0; [L240] int systemActive = 1; [L701] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L899] int waterLevel = 1; [L900] int methaneLevelCritical = 0; [L131] int retValue_acc ; [L132] int tmp ; [L136] FCALL select_helpers() [L137] FCALL select_features() [L138] CALL, EXPR valid_product() [L497] int retValue_acc ; [L500] retValue_acc = 1 [L501] return (retValue_acc); [L138] RET, EXPR valid_product() [L138] tmp = valid_product() [L140] COND TRUE \read(tmp) [L142] FCALL setup() [L143] CALL runTest() [L122] CALL test() [L156] int splverifierCounter ; [L157] int tmp ; [L158] int tmp___0 ; [L159] int tmp___1 ; [L160] int tmp___2 ; [L163] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L165] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L167] COND TRUE splverifierCounter < 4 [L173] tmp = __VERIFIER_nondet_int() [L175] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L177] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L917] COND TRUE waterLevel < 2 [L918] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L177] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L183] tmp___0 = __VERIFIER_nondet_int() [L185] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L187] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L929] COND FALSE !(\read(methaneLevelCritical)) [L932] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L187] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L193] tmp___2 = __VERIFIER_nondet_int() [L195] COND TRUE \read(tmp___2) [L197] CALL startSystem() [L466] systemActive = 1 [L197] RET startSystem() [L210] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L247] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L254] COND TRUE \read(systemActive) [L256] CALL processEnvironment() [L328] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L331] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L346] CALL processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L302] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L305] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L320] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L276] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L279] COND TRUE ! pumpRunning [L281] CALL, EXPR isHighWaterLevel() [L425] int retValue_acc ; [L426] int tmp ; [L427] int tmp___0 ; [L431] CALL, EXPR isHighWaterSensorDry() [L979] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L982] COND FALSE !(waterLevel < 2) [L986] retValue_acc = 0 [L987] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L431] RET, EXPR isHighWaterSensorDry() [L431] tmp = isHighWaterSensorDry() [L433] COND FALSE !(\read(tmp)) [L436] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L438] retValue_acc = tmp___0 [L439] return (retValue_acc); [L281] RET, EXPR isHighWaterLevel() [L281] tmp = isHighWaterLevel() [L283] COND TRUE \read(tmp) [L285] CALL activatePump() [L356] pumpRunning = 1 [L285] RET activatePump() [L320] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L346] RET processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L256] RET processEnvironment() [L262] CALL __utac_acc__Specification1_spec__1() [L507] int tmp ; [L508] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L512] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L938] int retValue_acc ; [L941] retValue_acc = methaneLevelCritical [L942] return (retValue_acc); [L512] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L512] tmp = isMethaneLevelCritical() [L514] COND TRUE \read(tmp) [L516] CALL, EXPR isPumpRunning() [L380] int retValue_acc ; [L383] retValue_acc = pumpRunning [L384] return (retValue_acc); [L516] RET, EXPR isPumpRunning() [L516] tmp___0 = isPumpRunning() [L518] COND TRUE \read(tmp___0) [L520] CALL __automaton_fail() [L226] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 991 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 1481 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 639 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 41 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 2/2 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-11 02:57:59,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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