./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_product40.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e58738f03c291d912b42eb65343509a99f93ac40ab295d49133dc12600f622b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:04:42,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:04:42,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:04:42,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:04:42,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:04:42,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:04:42,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:04:42,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:04:42,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:04:42,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:04:42,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:04:42,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:04:42,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:04:42,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:04:42,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:04:42,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:04:42,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:04:42,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:04:42,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:04:42,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:04:42,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:04:42,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:04:42,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:04:42,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:04:42,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:04:42,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:04:42,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:04:42,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:04:42,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:04:42,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:04:42,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:04:42,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:04:42,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:42,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:04:42,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:04:42,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:04:42,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:04:42,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:04:42,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:04:42,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:04:42,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:04:42,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:04:42,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e58738f03c291d912b42eb65343509a99f93ac40ab295d49133dc12600f622b8 [2024-11-19 22:04:43,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:04:43,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:04:43,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:04:43,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:04:43,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:04:43,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2024-11-19 22:04:44,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:04:44,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:04:44,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c [2024-11-19 22:04:44,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da554c34/0a9565c95e1e45b28013eed1f0c18aa3/FLAG3f3aadca4 [2024-11-19 22:04:44,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da554c34/0a9565c95e1e45b28013eed1f0c18aa3 [2024-11-19 22:04:44,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:04:44,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:04:44,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:44,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:04:44,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:04:44,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:44" (1/1) ... [2024-11-19 22:04:44,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16564e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:44, skipping insertion in model container [2024-11-19 22:04:44,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:04:44" (1/1) ... [2024-11-19 22:04:44,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:04:45,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c[7390,7403] [2024-11-19 22:04:45,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:45,401 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:04:45,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2024-11-19 22:04:45,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [262] [2024-11-19 22:04:45,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [334] [2024-11-19 22:04:45,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [361] [2024-11-19 22:04:45,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2024-11-19 22:04:45,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [495] [2024-11-19 22:04:45,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [504] [2024-11-19 22:04:45,417 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [870] [2024-11-19 22:04:45,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product40.cil.c[7390,7403] [2024-11-19 22:04:45,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:04:45,524 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:04:45,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45 WrapperNode [2024-11-19 22:04:45,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:04:45,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:45,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:04:45,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:04:45,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,563 INFO L138 Inliner]: procedures = 55, calls = 100, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 192 [2024-11-19 22:04:45,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:04:45,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:04:45,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:04:45,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:04:45,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,588 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:04:45,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:04:45,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:04:45,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:04:45,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:04:45,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (1/1) ... [2024-11-19 22:04:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:04:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:04:45,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:04:45,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:04:45,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:04:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:04:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:04:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:04:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:04:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:04:45,691 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:04:45,691 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:04:45,692 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:04:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:04:45,692 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:04:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:04:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:04:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-19 22:04:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-19 22:04:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:04:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:04:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:04:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:04:45,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:04:45,767 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:04:45,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:04:45,986 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-19 22:04:45,987 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:04:46,000 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:04:46,000 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:04:46,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:46 BoogieIcfgContainer [2024-11-19 22:04:46,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:04:46,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:04:46,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:04:46,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:04:46,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:04:44" (1/3) ... [2024-11-19 22:04:46,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be012e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:46, skipping insertion in model container [2024-11-19 22:04:46,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:04:45" (2/3) ... [2024-11-19 22:04:46,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be012e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:04:46, skipping insertion in model container [2024-11-19 22:04:46,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:46" (3/3) ... [2024-11-19 22:04:46,011 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product40.cil.c [2024-11-19 22:04:46,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:04:46,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:04:46,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:04:46,101 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;@19c6671e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:04:46,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:04:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 78 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 22:04:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 22:04:46,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,116 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-11-19 22:04:46,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash 224099000, now seen corresponding path program 1 times [2024-11-19 22:04:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414486086] [2024-11-19 22:04:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:04:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414486086] [2024-11-19 22:04:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414486086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:04:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331471056] [2024-11-19 22:04:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:04:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:04:46,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:04:46,344 INFO L87 Difference]: Start difference. First operand has 93 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 78 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,391 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2024-11-19 22:04:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:04:46,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2024-11-19 22:04:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,404 INFO L225 Difference]: With dead ends: 178 [2024-11-19 22:04:46,404 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 22:04:46,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:04:46,413 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:46,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 22:04:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 22:04:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 70 states have internal predecessors, (81), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 22:04:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2024-11-19 22:04:46,468 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 23 [2024-11-19 22:04:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,469 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2024-11-19 22:04:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2024-11-19 22:04:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:04:46,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,474 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] [2024-11-19 22:04:46,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:04:46,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2095441880, now seen corresponding path program 1 times [2024-11-19 22:04:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801454226] [2024-11-19 22:04:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:04:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:46,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801454226] [2024-11-19 22:04:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801454226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182813891] [2024-11-19 22:04:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,616 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,645 INFO L93 Difference]: Finished difference Result 129 states and 165 transitions. [2024-11-19 22:04:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:46,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2024-11-19 22:04:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,649 INFO L225 Difference]: With dead ends: 129 [2024-11-19 22:04:46,650 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 22:04:46,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,652 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:46,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 22:04:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-19 22:04:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 64 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 22:04:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-19 22:04:46,668 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 24 [2024-11-19 22:04:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-19 22:04:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-19 22:04:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 22:04:46,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,673 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] [2024-11-19 22:04:46,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:04:46,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash 883410657, now seen corresponding path program 1 times [2024-11-19 22:04:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58473677] [2024-11-19 22:04:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:04:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58473677] [2024-11-19 22:04:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58473677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:46,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:46,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:04:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521375555] [2024-11-19 22:04:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:04:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:46,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:04:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,838 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:46,891 INFO L93 Difference]: Finished difference Result 209 states and 273 transitions. [2024-11-19 22:04:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:04:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2024-11-19 22:04:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:46,894 INFO L225 Difference]: With dead ends: 209 [2024-11-19 22:04:46,894 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 22:04:46,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:04:46,897 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 88 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:46,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 193 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:04:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 22:04:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-19 22:04:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 116 states have internal predecessors, (136), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 22:04:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2024-11-19 22:04:46,919 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 29 [2024-11-19 22:04:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:46,920 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2024-11-19 22:04:46,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2024-11-19 22:04:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 22:04:46,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:46,922 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-11-19 22:04:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:04:46,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1458245104, now seen corresponding path program 1 times [2024-11-19 22:04:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434197026] [2024-11-19 22:04:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:46,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 22:04:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434197026] [2024-11-19 22:04:47,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434197026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:47,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424503700] [2024-11-19 22:04:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:47,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,103 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,228 INFO L93 Difference]: Finished difference Result 352 states and 471 transitions. [2024-11-19 22:04:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:47,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 22:04:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,234 INFO L225 Difference]: With dead ends: 352 [2024-11-19 22:04:47,235 INFO L226 Difference]: Without dead ends: 221 [2024-11-19 22:04:47,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:04:47,240 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:47,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 338 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-19 22:04:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2024-11-19 22:04:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 163 states have (on average 1.3067484662576687) internal successors, (213), 178 states have internal predecessors, (213), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2024-11-19 22:04:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2024-11-19 22:04:47,299 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 32 [2024-11-19 22:04:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,299 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2024-11-19 22:04:47,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:04:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2024-11-19 22:04:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:04:47,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:04:47,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash -698554300, now seen corresponding path program 1 times [2024-11-19 22:04:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415669939] [2024-11-19 22:04:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:04:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:04:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415669939] [2024-11-19 22:04:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415669939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:04:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028814422] [2024-11-19 22:04:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:04:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:04:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:04:47,451 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,645 INFO L93 Difference]: Finished difference Result 485 states and 626 transitions. [2024-11-19 22:04:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:04:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 43 [2024-11-19 22:04:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,649 INFO L225 Difference]: With dead ends: 485 [2024-11-19 22:04:47,650 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 22:04:47,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:04:47,656 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 48 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:47,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 22:04:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2024-11-19 22:04:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 203 states have (on average 1.2758620689655173) internal successors, (259), 218 states have internal predecessors, (259), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-19 22:04:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 341 transitions. [2024-11-19 22:04:47,695 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 341 transitions. Word has length 43 [2024-11-19 22:04:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 341 transitions. [2024-11-19 22:04:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 341 transitions. [2024-11-19 22:04:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:04:47,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:04:47,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1602268290, now seen corresponding path program 1 times [2024-11-19 22:04:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769334744] [2024-11-19 22:04:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:04:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:04:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769334744] [2024-11-19 22:04:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769334744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410203931] [2024-11-19 22:04:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:47,780 INFO L87 Difference]: Start difference. First operand 270 states and 341 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:47,929 INFO L93 Difference]: Finished difference Result 539 states and 698 transitions. [2024-11-19 22:04:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:04:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 43 [2024-11-19 22:04:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:47,932 INFO L225 Difference]: With dead ends: 539 [2024-11-19 22:04:47,932 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 22:04:47,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:04:47,936 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:47,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 259 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:04:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 22:04:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2024-11-19 22:04:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 222 states have internal predecessors, (263), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-19 22:04:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 345 transitions. [2024-11-19 22:04:47,973 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 345 transitions. Word has length 43 [2024-11-19 22:04:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:47,973 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 345 transitions. [2024-11-19 22:04:47,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 345 transitions. [2024-11-19 22:04:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 22:04:47,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:47,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:47,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:04:47,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:47,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 784619840, now seen corresponding path program 1 times [2024-11-19 22:04:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:47,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780049626] [2024-11-19 22:04:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:04:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:04:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780049626] [2024-11-19 22:04:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780049626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:04:48,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767701175] [2024-11-19 22:04:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:48,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:04:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:04:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:04:48,068 INFO L87 Difference]: Start difference. First operand 274 states and 345 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:48,286 INFO L93 Difference]: Finished difference Result 792 states and 1037 transitions. [2024-11-19 22:04:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:04:48,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 43 [2024-11-19 22:04:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:48,290 INFO L225 Difference]: With dead ends: 792 [2024-11-19 22:04:48,290 INFO L226 Difference]: Without dead ends: 525 [2024-11-19 22:04:48,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:04:48,292 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 208 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:48,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 284 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:04:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-19 22:04:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 518. [2024-11-19 22:04:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 391 states have (on average 1.2429667519181586) internal successors, (486), 415 states have internal predecessors, (486), 65 states have call successors, (65), 59 states have call predecessors, (65), 61 states have return successors, (103), 64 states have call predecessors, (103), 65 states have call successors, (103) [2024-11-19 22:04:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 654 transitions. [2024-11-19 22:04:48,339 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 654 transitions. Word has length 43 [2024-11-19 22:04:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:48,340 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 654 transitions. [2024-11-19 22:04:48,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:04:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 654 transitions. [2024-11-19 22:04:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 22:04:48,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:48,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:48,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:04:48,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:48,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:48,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2122122074, now seen corresponding path program 1 times [2024-11-19 22:04:48,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:48,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205949589] [2024-11-19 22:04:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 22:04:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:04:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 22:04:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:04:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:04:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:04:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205949589] [2024-11-19 22:04:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205949589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:04:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:04:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:04:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178182028] [2024-11-19 22:04:48,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:04:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:04:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:04:48,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:04:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:04:48,463 INFO L87 Difference]: Start difference. First operand 518 states and 654 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:04:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:04:49,030 INFO L93 Difference]: Finished difference Result 1748 states and 2296 transitions. [2024-11-19 22:04:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 22:04:49,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 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 47 [2024-11-19 22:04:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:04:49,042 INFO L225 Difference]: With dead ends: 1748 [2024-11-19 22:04:49,042 INFO L226 Difference]: Without dead ends: 1237 [2024-11-19 22:04:49,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-19 22:04:49,045 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 273 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:04:49,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 362 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:04:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-19 22:04:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1195. [2024-11-19 22:04:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 890 states have (on average 1.208988764044944) internal successors, (1076), 953 states have internal predecessors, (1076), 162 states have call successors, (162), 118 states have call predecessors, (162), 142 states have return successors, (288), 164 states have call predecessors, (288), 162 states have call successors, (288) [2024-11-19 22:04:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1526 transitions. [2024-11-19 22:04:49,146 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1526 transitions. Word has length 47 [2024-11-19 22:04:49,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:04:49,147 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1526 transitions. [2024-11-19 22:04:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:04:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1526 transitions. [2024-11-19 22:04:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 22:04:49,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:04:49,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:04:49,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:04:49,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:04:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1992473686, now seen corresponding path program 1 times [2024-11-19 22:04:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:04:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540075131] [2024-11-19 22:04:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:04:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:04:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:49,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 22:04:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 22:04:49,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 22:04:49,206 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 22:04:49,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:04:49,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:04:49,212 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:04:49,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:04:49,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:04:49 BoogieIcfgContainer [2024-11-19 22:04:49,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:04:49,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:04:49,263 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:04:49,263 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:04:49,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:04:46" (3/4) ... [2024-11-19 22:04:49,264 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 22:04:49,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:04:49,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:04:49,326 INFO L158 Benchmark]: Toolchain (without parser) took 4393.80ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 122.9MB in the beginning and 138.0MB in the end (delta: -15.1MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,326 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:04:49,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.02ms. Allocated memory is still 188.7MB. Free memory was 122.9MB in the beginning and 150.0MB in the end (delta: -27.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 148.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,328 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 188.7MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,328 INFO L158 Benchmark]: RCFGBuilder took 400.66ms. Allocated memory is still 188.7MB. Free memory was 145.1MB in the beginning and 127.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,328 INFO L158 Benchmark]: TraceAbstraction took 3259.28ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 127.0MB in the beginning and 142.2MB in the end (delta: -15.2MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,329 INFO L158 Benchmark]: Witness Printer took 63.17ms. Allocated memory is still 241.2MB. Free memory was 142.2MB in the beginning and 138.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:04:49,330 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.21ms. Allocated memory is still 94.4MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.02ms. Allocated memory is still 188.7MB. Free memory was 122.9MB in the beginning and 150.0MB in the end (delta: -27.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 148.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 188.7MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.66ms. Allocated memory is still 188.7MB. Free memory was 145.1MB in the beginning and 127.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3259.28ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 127.0MB in the beginning and 142.2MB in the end (delta: -15.2MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 63.17ms. Allocated memory is still 241.2MB. Free memory was 142.2MB in the beginning and 138.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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,"MinePump.i","") [49] - GenericResultAtLocation [Line: 262]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [262] - GenericResultAtLocation [Line: 334]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [334] - GenericResultAtLocation [Line: 361]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [361] - GenericResultAtLocation [Line: 460]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [495] - GenericResultAtLocation [Line: 504]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [504] - GenericResultAtLocation [Line: 870]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [870] * 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: 500]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L61] int pumpRunning = 0; [L62] int systemActive = 1; [L362] int cleanupTimeShifts = 4; [L674] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L872] int waterLevel = 1; [L873] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L438] int retValue_acc ; [L439] int tmp ; [L443] FCALL select_helpers() [L444] FCALL select_features() [L445] CALL, EXPR valid_product() [L487] int retValue_acc ; [L490] retValue_acc = 1 [L491] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L445] RET, EXPR valid_product() [L445] tmp = valid_product() [L447] COND TRUE \read(tmp) [L449] FCALL setup() [L450] CALL runTest() [L429] CALL test() [L267] int splverifierCounter ; [L268] int tmp ; [L269] int tmp___0 ; [L270] int tmp___1 ; [L271] int tmp___2 ; [L274] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L276] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L278] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L284] tmp = __VERIFIER_nondet_int() [L286] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L288] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L890] COND TRUE waterLevel < 2 [L891] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L288] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L294] tmp___0 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L298] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L902] COND FALSE !(\read(methaneLevelCritical)) [L905] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L298] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L304] tmp___2 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp___2) [L308] CALL startSystem() [L258] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L308] RET startSystem() [L323] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L69] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L76] COND TRUE \read(systemActive) [L78] CALL processEnvironment() [L124] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L127] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L142] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L98] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L101] COND TRUE ! pumpRunning [L103] CALL, EXPR isHighWaterLevel() [L221] int retValue_acc ; [L222] int tmp ; [L223] int tmp___0 ; [L227] CALL, EXPR isHighWaterSensorDry() [L952] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L955] COND FALSE !(waterLevel < 2) [L959] retValue_acc = 0 [L960] 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] [L227] RET, EXPR isHighWaterSensorDry() [L227] tmp = isHighWaterSensorDry() [L229] COND FALSE !(\read(tmp)) [L232] 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] [L234] retValue_acc = tmp___0 [L235] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L103] RET, EXPR isHighWaterLevel() [L103] tmp = isHighWaterLevel() [L105] COND TRUE \read(tmp) [L107] CALL activatePump() [L152] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L107] RET activatePump() [L142] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L78] RET processEnvironment() [L84] CALL __utac_acc__Specification1_spec__1() [L337] int tmp ; [L338] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L911] int retValue_acc ; [L914] retValue_acc = methaneLevelCritical [L915] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L342] tmp = isMethaneLevelCritical() [L344] COND TRUE \read(tmp) [L346] CALL, EXPR isPumpRunning() [L176] int retValue_acc ; [L179] retValue_acc = pumpRunning [L180] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L346] RET, EXPR isPumpRunning() [L346] tmp___0 = isPumpRunning() [L348] COND TRUE \read(tmp___0) [L350] CALL __automaton_fail() [L500] 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, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 730 mSDsluCounter, 2051 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1299 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 699 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 752 mSDtfsCounter, 699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1195occurred in iteration=8, InterpolantAutomatonStates: 50, 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, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 474 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-11-19 22:04:49,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE