./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_product52.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_product52.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 8521353bcf4bae83665566564f0550ca2d5ed2f2d2c87d1236006cfbb2433fe4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:57:50,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:57:50,606 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:50,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:57:50,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:57:50,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:57:50,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:57:50,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:57:50,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:57:50,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:57:50,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:57:50,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:57:50,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:57:50,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:57:50,652 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:57:50,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:57:50,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:57:50,653 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:57:50,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:57:50,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:57:50,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:57:50,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:57:50,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:57:50,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:57:50,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:57:50,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:57:50,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:57:50,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:57:50,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:57:50,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:57:50,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:57:50,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:57:50,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:57:50,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:57:50,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:57:50,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:57:50,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:57:50,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:57:50,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:57:50,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:57:50,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:57:50,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:57:50,658 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 -> 8521353bcf4bae83665566564f0550ca2d5ed2f2d2c87d1236006cfbb2433fe4 [2024-10-11 02:57:50,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:57:50,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:57:50,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:57:50,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:57:50,874 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:57:50,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2024-10-11 02:57:52,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:57:52,433 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:57:52,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2024-10-11 02:57:52,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca4a2a1fa/fcdd343cc44c4fa489d676fd64bea990/FLAGafa127fc1 [2024-10-11 02:57:52,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca4a2a1fa/fcdd343cc44c4fa489d676fd64bea990 [2024-10-11 02:57:52,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:57:52,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:57:52,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:57:52,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:57:52,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:57:52,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:52" (1/1) ... [2024-10-11 02:57:52,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b015d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:52, skipping insertion in model container [2024-10-11 02:57:52,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:57:52" (1/1) ... [2024-10-11 02:57:52,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:57:52,669 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_product52.cil.c[6162,6175] [2024-10-11 02:57:52,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:57:52,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:57:52,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-11 02:57:52,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] [2024-10-11 02:57:52,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [388] [2024-10-11 02:57:52,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [397] [2024-10-11 02:57:52,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [467] [2024-10-11 02:57:52,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [566] [2024-10-11 02:57:52,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [592] [2024-10-11 02:57:52,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [958] [2024-10-11 02:57:52,856 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_product52.cil.c[6162,6175] [2024-10-11 02:57:52,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:57:52,929 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:57:52,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:52 WrapperNode [2024-10-11 02:57:52,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:57:52,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:57:52,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:57:52,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:57:52,937 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:52" (1/1) ... [2024-10-11 02:57:52,954 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:52" (1/1) ... [2024-10-11 02:57:52,984 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 204 [2024-10-11 02:57:52,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:57:52,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:57:52,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:57:52,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:57:53,002 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:52" (1/1) ... [2024-10-11 02:57:53,002 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:52" (1/1) ... [2024-10-11 02:57:53,005 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:52" (1/1) ... [2024-10-11 02:57:53,029 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:53,033 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:52" (1/1) ... [2024-10-11 02:57:53,033 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:52" (1/1) ... [2024-10-11 02:57:53,039 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:52" (1/1) ... [2024-10-11 02:57:53,046 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:52" (1/1) ... [2024-10-11 02:57:53,051 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:52" (1/1) ... [2024-10-11 02:57:53,052 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:52" (1/1) ... [2024-10-11 02:57:53,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:57:53,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:57:53,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:57:53,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:57:53,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:52" (1/1) ... [2024-10-11 02:57:53,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:57:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:57:53,092 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:53,105 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:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:57:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:57:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:57:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:57:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:57:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:57:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:57:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:57:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:57:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:57:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:57:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:57:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:57:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 02:57:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 02:57:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:57:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:57:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:57:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:57:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:57:53,238 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:57:53,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:57:53,521 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-11 02:57:53,521 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:57:53,604 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:57:53,608 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:57:53,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:53 BoogieIcfgContainer [2024-10-11 02:57:53,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:57:53,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:57:53,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:57:53,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:57:53,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:57:52" (1/3) ... [2024-10-11 02:57:53,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d382dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:53, skipping insertion in model container [2024-10-11 02:57:53,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:57:52" (2/3) ... [2024-10-11 02:57:53,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d382dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:57:53, skipping insertion in model container [2024-10-11 02:57:53,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:57:53" (3/3) ... [2024-10-11 02:57:53,631 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product52.cil.c [2024-10-11 02:57:53,654 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:57:53,654 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:57:53,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:57:53,714 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;@3ecca508, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:57:53,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:57:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.54) internal successors, (77), 59 states have internal predecessors, (77), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 02:57:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 02:57:53,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:53,728 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:53,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:53,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash -461333429, now seen corresponding path program 1 times [2024-10-11 02:57:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823589837] [2024-10-11 02:57:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:57:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:53,886 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:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:53,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823589837] [2024-10-11 02:57:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823589837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:53,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:53,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:57:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630811933] [2024-10-11 02:57:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:53,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:57:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:57:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:57:53,918 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.54) internal successors, (77), 59 states have internal predecessors, (77), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) 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:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:54,051 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2024-10-11 02:57:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:57:54,054 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:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:54,064 INFO L225 Difference]: With dead ends: 144 [2024-10-11 02:57:54,064 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 02:57:54,067 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:54,069 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:54,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 02:57:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 02:57:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.425531914893617) internal successors, (67), 55 states have internal predecessors, (67), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 02:57:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-11 02:57:54,102 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 16 [2024-10-11 02:57:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:54,102 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-11 02:57:54,103 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:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-11 02:57:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:57:54,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:54,104 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:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:57:54,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1587365836, now seen corresponding path program 1 times [2024-10-11 02:57:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621642465] [2024-10-11 02:57:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:57:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,193 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:54,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621642465] [2024-10-11 02:57:54,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621642465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:54,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:57:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45558914] [2024-10-11 02:57:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:54,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:57:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:57:54,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:54,196 INFO L87 Difference]: Start difference. First operand 68 states and 92 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:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:54,229 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2024-10-11 02:57:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:57:54,229 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:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:54,231 INFO L225 Difference]: With dead ends: 106 [2024-10-11 02:57:54,231 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 02:57:54,232 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:54,233 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:54,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:57:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 02:57:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 02:57:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 50 states have internal predecessors, (61), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 02:57:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-10-11 02:57:54,241 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 17 [2024-10-11 02:57:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:54,241 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-11 02:57:54,241 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:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-10-11 02:57:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 02:57:54,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:54,242 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:54,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:57:54,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash -402928600, now seen corresponding path program 1 times [2024-10-11 02:57:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161404506] [2024-10-11 02:57:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,326 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:54,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161404506] [2024-10-11 02:57:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161404506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:57:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128666356] [2024-10-11 02:57:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:57:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:54,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:57:54,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:57:54,331 INFO L87 Difference]: Start difference. First operand 60 states and 81 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:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:54,407 INFO L93 Difference]: Finished difference Result 176 states and 240 transitions. [2024-10-11 02:57:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:57:54,411 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:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:54,413 INFO L225 Difference]: With dead ends: 176 [2024-10-11 02:57:54,413 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 02:57:54,413 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:54,414 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:54,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 02:57:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-11 02:57:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.4625) internal successors, (117), 95 states have internal predecessors, (117), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 02:57:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 157 transitions. [2024-10-11 02:57:54,446 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 157 transitions. Word has length 20 [2024-10-11 02:57:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:54,446 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 157 transitions. [2024-10-11 02:57:54,446 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:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 157 transitions. [2024-10-11 02:57:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 02:57:54,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:54,448 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] [2024-10-11 02:57:54,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:57:54,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:54,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2061931373, now seen corresponding path program 1 times [2024-10-11 02:57:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643906851] [2024-10-11 02:57:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:54,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:57:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,521 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:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643906851] [2024-10-11 02:57:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643906851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:57:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832818313] [2024-10-11 02:57:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:57:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:57:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:57:54,524 INFO L87 Difference]: Start difference. First operand 115 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:54,623 INFO L93 Difference]: Finished difference Result 302 states and 421 transitions. [2024-10-11 02:57:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:57:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 02:57:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:54,626 INFO L225 Difference]: With dead ends: 302 [2024-10-11 02:57:54,626 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 02:57:54,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:54,628 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 55 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:54,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 182 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 02:57:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2024-10-11 02:57:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 148 states have internal predecessors, (185), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2024-10-11 02:57:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 249 transitions. [2024-10-11 02:57:54,659 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 249 transitions. Word has length 23 [2024-10-11 02:57:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 249 transitions. [2024-10-11 02:57:54,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:57:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 249 transitions. [2024-10-11 02:57:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 02:57:54,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:54,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:54,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:57:54,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash -606223895, now seen corresponding path program 1 times [2024-10-11 02:57:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179206683] [2024-10-11 02:57:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:57:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:54,786 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:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179206683] [2024-10-11 02:57:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179206683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:57:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686886983] [2024-10-11 02:57:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:57:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:57:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:57:54,790 INFO L87 Difference]: Start difference. First operand 188 states and 249 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:54,921 INFO L93 Difference]: Finished difference Result 416 states and 557 transitions. [2024-10-11 02:57:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:57:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-11 02:57:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:54,928 INFO L225 Difference]: With dead ends: 416 [2024-10-11 02:57:54,928 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 02:57:54,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:57:54,932 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 44 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:54,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 177 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 02:57:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2024-10-11 02:57:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 178 states have internal predecessors, (221), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-10-11 02:57:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 299 transitions. [2024-10-11 02:57:54,967 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 299 transitions. Word has length 32 [2024-10-11 02:57:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 299 transitions. [2024-10-11 02:57:54,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 299 transitions. [2024-10-11 02:57:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 02:57:54,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:54,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:54,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:57:54,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:54,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1617341145, now seen corresponding path program 1 times [2024-10-11 02:57:54,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:54,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041314710] [2024-10-11 02:57:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:57:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,045 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:55,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:55,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041314710] [2024-10-11 02:57:55,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041314710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:55,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:57:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901910668] [2024-10-11 02:57:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:55,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:57:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:57:55,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:57:55,048 INFO L87 Difference]: Start difference. First operand 228 states and 299 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:55,232 INFO L93 Difference]: Finished difference Result 466 states and 623 transitions. [2024-10-11 02:57:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:57:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-11 02:57:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:55,235 INFO L225 Difference]: With dead ends: 466 [2024-10-11 02:57:55,235 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 02:57:55,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:57:55,236 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 145 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:55,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 259 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:57:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 02:57:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 232. [2024-10-11 02:57:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 167 states have (on average 1.347305389221557) internal successors, (225), 182 states have internal predecessors, (225), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-10-11 02:57:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 303 transitions. [2024-10-11 02:57:55,252 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 303 transitions. Word has length 32 [2024-10-11 02:57:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 303 transitions. [2024-10-11 02:57:55,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 303 transitions. [2024-10-11 02:57:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 02:57:55,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:55,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:55,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:57:55,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:55,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1656557797, now seen corresponding path program 1 times [2024-10-11 02:57:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:55,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972530909] [2024-10-11 02:57:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:57:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:57:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,315 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:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972530909] [2024-10-11 02:57:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972530909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:57:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490079023] [2024-10-11 02:57:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:55,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:57:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:57:55,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:57:55,318 INFO L87 Difference]: Start difference. First operand 232 states and 303 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:55,594 INFO L93 Difference]: Finished difference Result 765 states and 1073 transitions. [2024-10-11 02:57:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:57:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-10-11 02:57:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:55,597 INFO L225 Difference]: With dead ends: 765 [2024-10-11 02:57:55,599 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 02:57:55,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:57:55,601 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 176 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:55,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 262 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:57:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 02:57:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-10-11 02:57:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 378 states have (on average 1.335978835978836) internal successors, (505), 407 states have internal predecessors, (505), 78 states have call successors, (78), 71 states have call predecessors, (78), 70 states have return successors, (128), 72 states have call predecessors, (128), 78 states have call successors, (128) [2024-10-11 02:57:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 711 transitions. [2024-10-11 02:57:55,640 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 711 transitions. Word has length 32 [2024-10-11 02:57:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:55,641 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 711 transitions. [2024-10-11 02:57:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:57:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 711 transitions. [2024-10-11 02:57:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 02:57:55,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:55,645 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] [2024-10-11 02:57:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:57:55,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1849989493, now seen corresponding path program 1 times [2024-10-11 02:57:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277206028] [2024-10-11 02:57:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:57:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:57:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:57:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:55,747 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:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:55,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277206028] [2024-10-11 02:57:55,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277206028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:55,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:57:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676291129] [2024-10-11 02:57:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:57:55,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:57:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:57:55,752 INFO L87 Difference]: Start difference. First operand 527 states and 711 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:57:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:56,165 INFO L93 Difference]: Finished difference Result 1756 states and 2466 transitions. [2024-10-11 02:57:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:57:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-11 02:57:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:56,175 INFO L225 Difference]: With dead ends: 1756 [2024-10-11 02:57:56,176 INFO L226 Difference]: Without dead ends: 1231 [2024-10-11 02:57:56,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:57:56,179 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 245 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:56,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 254 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:57:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-10-11 02:57:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1225. [2024-10-11 02:57:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 872 states have (on average 1.2855504587155964) internal successors, (1121), 945 states have internal predecessors, (1121), 192 states have call successors, (192), 142 states have call predecessors, (192), 160 states have return successors, (348), 184 states have call predecessors, (348), 192 states have call successors, (348) [2024-10-11 02:57:56,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1661 transitions. [2024-10-11 02:57:56,277 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1661 transitions. Word has length 36 [2024-10-11 02:57:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:56,278 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1661 transitions. [2024-10-11 02:57:56,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:57:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1661 transitions. [2024-10-11 02:57:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 02:57:56,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:56,281 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:56,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:57:56,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 739372847, now seen corresponding path program 1 times [2024-10-11 02:57:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027096994] [2024-10-11 02:57:56,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:57:56,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:57:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:57:56,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:57:56,324 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:57:56,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:57:56,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:57:56,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:56,374 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:57:56,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:57:56 BoogieIcfgContainer [2024-10-11 02:57:56,376 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:57:56,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:57:56,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:57:56,377 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:57:56,377 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:53" (3/4) ... [2024-10-11 02:57:56,378 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:57:56,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:57:56,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:57:56,434 INFO L158 Benchmark]: Toolchain (without parser) took 3970.70ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 97.2MB in the beginning and 164.3MB in the end (delta: -67.1MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,434 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:57:56,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.71ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 97.0MB in the beginning and 213.7MB in the end (delta: -116.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 247.5MB. Free memory was 213.7MB in the beginning and 211.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,436 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 247.5MB. Free memory was 211.6MB in the beginning and 208.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,436 INFO L158 Benchmark]: RCFGBuilder took 554.48ms. Allocated memory is still 247.5MB. Free memory was 208.4MB in the beginning and 184.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,436 INFO L158 Benchmark]: TraceAbstraction took 2764.35ms. Allocated memory is still 247.5MB. Free memory was 184.3MB in the beginning and 168.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,436 INFO L158 Benchmark]: Witness Printer took 57.18ms. Allocated memory is still 247.5MB. Free memory was 168.5MB in the beginning and 164.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:57:56,437 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.13ms. Allocated memory is still 169.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.71ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 97.0MB in the beginning and 213.7MB in the end (delta: -116.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 247.5MB. Free memory was 213.7MB in the beginning and 211.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 247.5MB. Free memory was 211.6MB in the beginning and 208.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.48ms. Allocated memory is still 247.5MB. Free memory was 208.4MB in the beginning and 184.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2764.35ms. Allocated memory is still 247.5MB. Free memory was 184.3MB in the beginning and 168.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 57.18ms. Allocated memory is still 247.5MB. Free memory was 168.5MB in the beginning and 164.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,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] - GenericResultAtLocation [Line: 388]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [388] - GenericResultAtLocation [Line: 397]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [397] - GenericResultAtLocation [Line: 467]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [467] - GenericResultAtLocation [Line: 566]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [566] - GenericResultAtLocation [Line: 592]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [592] - GenericResultAtLocation [Line: 958]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [958] * 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: 393]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int waterLevel = 1; [L59] int methaneLevelCritical = 0; [L168] int pumpRunning = 0; [L169] int systemActive = 1; [L468] int cleanupTimeShifts = 4; [L762] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L544] int retValue_acc ; [L545] int tmp ; [L549] FCALL select_helpers() [L550] FCALL select_features() [L551] CALL, EXPR valid_product() [L985] int retValue_acc ; [L988] retValue_acc = 1 [L989] return (retValue_acc); [L551] RET, EXPR valid_product() [L551] tmp = valid_product() [L553] COND TRUE \read(tmp) [L555] FCALL setup() [L556] CALL runTest() [L535] CALL test() [L400] int splverifierCounter ; [L401] int tmp ; [L402] int tmp___0 ; [L403] int tmp___1 ; [L404] int tmp___2 ; [L407] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L409] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L411] COND TRUE splverifierCounter < 4 [L417] tmp = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L421] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L76] COND TRUE waterLevel < 2 [L77] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L421] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L427] tmp___0 = __VERIFIER_nondet_int() [L429] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L431] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L88] COND FALSE !(\read(methaneLevelCritical)) [L91] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L431] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L437] tmp___2 = __VERIFIER_nondet_int() [L439] COND TRUE \read(tmp___2) [L441] CALL startSystem() [L384] systemActive = 1 [L441] RET startSystem() [L456] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L176] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L183] COND TRUE \read(systemActive) [L185] CALL processEnvironment() [L231] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L234] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L249] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L205] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L208] COND TRUE ! pumpRunning [L210] CALL, EXPR isHighWaterLevel() [L328] int retValue_acc ; [L329] int tmp ; [L330] int tmp___0 ; [L334] CALL, EXPR isHighWaterSensorDry() [L138] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L141] COND FALSE !(waterLevel < 2) [L145] retValue_acc = 0 [L146] 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] [L334] RET, EXPR isHighWaterSensorDry() [L334] tmp = isHighWaterSensorDry() [L336] COND FALSE !(\read(tmp)) [L339] 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] [L341] retValue_acc = tmp___0 [L342] return (retValue_acc); [L210] RET, EXPR isHighWaterLevel() [L210] tmp = isHighWaterLevel() [L212] COND TRUE \read(tmp) [L214] CALL activatePump() [L259] pumpRunning = 1 [L214] RET activatePump() [L249] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L185] RET processEnvironment() [L191] CALL __utac_acc__Specification1_spec__1() [L568] int tmp ; [L569] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L573] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L97] int retValue_acc ; [L100] retValue_acc = methaneLevelCritical [L101] return (retValue_acc); [L573] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L573] tmp = isMethaneLevelCritical() [L575] COND TRUE \read(tmp) [L577] CALL, EXPR isPumpRunning() [L283] int retValue_acc ; [L286] retValue_acc = pumpRunning [L287] return (retValue_acc); [L577] RET, EXPR isPumpRunning() [L577] tmp___0 = isPumpRunning() [L579] COND TRUE \read(tmp___0) [L581] CALL __automaton_fail() [L393] 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 9 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 754 mSDsluCounter, 1479 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 904 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 977 IncrementalHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 575 mSDtfsCounter, 977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1225occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:57:56,465 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