./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_spec2_product49.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_spec2_product49.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 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:05:41,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:05:41,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:05:41,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:05:41,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:05:41,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:05:41,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:05:41,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:05:41,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:05:41,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:05:41,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:05:41,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:05:41,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:05:41,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:05:41,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:05:41,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:05:41,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:05:41,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:05:41,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:05:41,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:05:41,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:05:41,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:05:41,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:05:41,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:05:41,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:05:41,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:05:41,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:05:41,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:05:41,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:05:41,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:05:41,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:05:41,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:05:41,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:41,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:05:41,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:05:41,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:05:41,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:05:41,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:05:41,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:05:41,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:05:41,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:05:41,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:05:41,824 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 -> 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d [2024-11-19 22:05:42,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:05:42,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:05:42,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:05:42,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:05:42,102 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:05:42,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c [2024-11-19 22:05:43,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:05:43,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:05:43,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c [2024-11-19 22:05:43,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98d25118/905c23a197544634b21217caefed405a/FLAG5d48c105c [2024-11-19 22:05:43,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b98d25118/905c23a197544634b21217caefed405a [2024-11-19 22:05:43,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:05:43,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:05:43,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:43,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:05:43,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:05:43,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:43" (1/1) ... [2024-11-19 22:05:43,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe5c44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:43, skipping insertion in model container [2024-11-19 22:05:43,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:43" (1/1) ... [2024-11-19 22:05:43,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:05:44,186 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_spec2_product49.cil.c[18359,18372] [2024-11-19 22:05:44,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:44,213 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:05:44,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-11-19 22:05:44,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155] [2024-11-19 22:05:44,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264] [2024-11-19 22:05:44,224 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305] [2024-11-19 22:05:44,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370] [2024-11-19 22:05:44,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569] [2024-11-19 22:05:44,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935] [2024-11-19 22:05:44,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944] [2024-11-19 22:05:44,291 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_spec2_product49.cil.c[18359,18372] [2024-11-19 22:05:44,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:44,320 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:05:44,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44 WrapperNode [2024-11-19 22:05:44,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:44,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:44,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:05:44,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:05:44,328 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:05:44" (1/1) ... [2024-11-19 22:05:44,342 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:05:44" (1/1) ... [2024-11-19 22:05:44,372 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 206 [2024-11-19 22:05:44,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:44,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:05:44,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:05:44,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:05:44,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,406 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:05:44,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:05:44,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:05:44,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:05:44,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:05:44,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (1/1) ... [2024-11-19 22:05:44,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:44,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:44,459 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:05:44,461 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:05:44,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:05:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:05:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:05:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:05:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:05:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:05:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:05:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:05:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:05:44,503 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:44,503 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:05:44,504 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:05:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:05:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:05:44,504 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:05:44,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:05:44,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:05:44,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:05:44,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:05:44,825 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-19 22:05:44,825 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:05:44,845 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:05:44,845 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:05:44,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:44 BoogieIcfgContainer [2024-11-19 22:05:44,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:05:44,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:05:44,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:05:44,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:05:44,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:05:43" (1/3) ... [2024-11-19 22:05:44,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e19b120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:44, skipping insertion in model container [2024-11-19 22:05:44,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:44" (2/3) ... [2024-11-19 22:05:44,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e19b120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:44, skipping insertion in model container [2024-11-19 22:05:44,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:44" (3/3) ... [2024-11-19 22:05:44,855 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product49.cil.c [2024-11-19 22:05:44,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:05:44,870 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:05:44,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:05:44,944 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;@3abd5f3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:05:44,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:05:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 22:05:44,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:05:44,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:44,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:44,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:44,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:44,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1277571174, now seen corresponding path program 1 times [2024-11-19 22:05:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794523508] [2024-11-19 22:05:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 22:05:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,214 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:05:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794523508] [2024-11-19 22:05:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794523508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:05:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372718158] [2024-11-19 22:05:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:45,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:05:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:45,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:05:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:05:45,255 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:45,290 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2024-11-19 22:05:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:05:45,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 22:05:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:45,301 INFO L225 Difference]: With dead ends: 167 [2024-11-19 22:05:45,302 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 22:05:45,305 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:05:45,310 INFO L432 NwaCegarLoop]: 111 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, 111 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:05:45,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:45,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 22:05:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 22:05:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 68 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 22:05:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-11-19 22:05:45,367 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 25 [2024-11-19 22:05:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:45,367 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-11-19 22:05:45,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-11-19 22:05:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 22:05:45,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:45,371 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] [2024-11-19 22:05:45,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:05:45,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:45,373 INFO L85 PathProgramCache]: Analyzing trace with hash -941221246, now seen corresponding path program 1 times [2024-11-19 22:05:45,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:45,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056113980] [2024-11-19 22:05:45,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:45,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 22:05:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,506 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:05:45,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:45,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056113980] [2024-11-19 22:05:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056113980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:45,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:05:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546028412] [2024-11-19 22:05:45,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:45,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:05:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:05:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:05:45,512 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:05:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:45,531 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2024-11-19 22:05:45,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:05:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26 [2024-11-19 22:05:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:45,533 INFO L225 Difference]: With dead ends: 123 [2024-11-19 22:05:45,533 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 22:05:45,534 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:05:45,535 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 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:05:45,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 22:05:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 22:05:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:05:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-19 22:05:45,554 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 26 [2024-11-19 22:05:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-19 22:05:45,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:05:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-19 22:05:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 22:05:45,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:45,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:45,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:05:45,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash -913943674, now seen corresponding path program 1 times [2024-11-19 22:05:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234417549] [2024-11-19 22:05:45,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:45,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:45,749 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:05:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234417549] [2024-11-19 22:05:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234417549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:05:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600987412] [2024-11-19 22:05:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:05:45,754 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:45,853 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2024-11-19 22:05:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-19 22:05:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:45,855 INFO L225 Difference]: With dead ends: 132 [2024-11-19 22:05:45,855 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 22:05:45,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:05:45,857 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:45,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 222 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 22:05:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 22:05:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:05:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-19 22:05:45,874 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 30 [2024-11-19 22:05:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-19 22:05:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:05:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-19 22:05:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 22:05:45,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:45,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:05:45,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1798308510, now seen corresponding path program 1 times [2024-11-19 22:05:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400117769] [2024-11-19 22:05:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:05:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,035 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:05:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:46,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400117769] [2024-11-19 22:05:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400117769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:46,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:46,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874426751] [2024-11-19 22:05:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:46,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:46,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:46,040 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:05:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:46,252 INFO L93 Difference]: Finished difference Result 206 states and 264 transitions. [2024-11-19 22:05:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:05:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2024-11-19 22:05:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:46,254 INFO L225 Difference]: With dead ends: 206 [2024-11-19 22:05:46,254 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 22:05:46,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:05:46,257 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 167 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:46,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 282 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:05:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 22:05:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-11-19 22:05:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 114 states have internal predecessors, (138), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-19 22:05:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2024-11-19 22:05:46,280 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 40 [2024-11-19 22:05:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2024-11-19 22:05:46,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:05:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2024-11-19 22:05:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:05:46,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:46,282 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] [2024-11-19 22:05:46,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:05:46,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1579167755, now seen corresponding path program 1 times [2024-11-19 22:05:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:46,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928226246] [2024-11-19 22:05:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:05:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,414 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:05:46,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:46,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928226246] [2024-11-19 22:05:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928226246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:46,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:05:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045234281] [2024-11-19 22:05:46,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:46,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:46,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:46,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:46,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:05:46,420 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:05:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:46,558 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions. [2024-11-19 22:05:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:05:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 44 [2024-11-19 22:05:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:46,561 INFO L225 Difference]: With dead ends: 273 [2024-11-19 22:05:46,561 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 22:05:46,562 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:05:46,567 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 51 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:46,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 355 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 22:05:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-19 22:05:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 117 states have internal predecessors, (141), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-19 22:05:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions. [2024-11-19 22:05:46,591 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 44 [2024-11-19 22:05:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:46,592 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions. [2024-11-19 22:05:46,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:05:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2024-11-19 22:05:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:05:46,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:46,597 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] [2024-11-19 22:05:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:05:46,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -109775987, now seen corresponding path program 1 times [2024-11-19 22:05:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528080757] [2024-11-19 22:05:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:05:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,705 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:05:46,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:46,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528080757] [2024-11-19 22:05:46,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528080757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:46,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396185218] [2024-11-19 22:05:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:46,709 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:05:46,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:46,811 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2024-11-19 22:05:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:46,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 44 [2024-11-19 22:05:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:46,814 INFO L225 Difference]: With dead ends: 278 [2024-11-19 22:05:46,815 INFO L226 Difference]: Without dead ends: 145 [2024-11-19 22:05:46,817 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:05:46,818 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:46,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 278 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-19 22:05:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2024-11-19 22:05:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 119 states have internal predecessors, (143), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-19 22:05:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2024-11-19 22:05:46,838 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 44 [2024-11-19 22:05:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:46,839 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2024-11-19 22:05:46,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:05:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2024-11-19 22:05:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:05:46,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:46,842 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] [2024-11-19 22:05:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:05:46,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:46,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 312925839, now seen corresponding path program 1 times [2024-11-19 22:05:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204649363] [2024-11-19 22:05:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:05:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:46,951 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:05:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204649363] [2024-11-19 22:05:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204649363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453160313] [2024-11-19 22:05:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:46,955 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:05:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:47,140 INFO L93 Difference]: Finished difference Result 400 states and 514 transitions. [2024-11-19 22:05:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:05:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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 44 [2024-11-19 22:05:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:47,143 INFO L225 Difference]: With dead ends: 400 [2024-11-19 22:05:47,144 INFO L226 Difference]: Without dead ends: 265 [2024-11-19 22:05:47,144 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:05:47,145 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 200 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:47,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 287 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-19 22:05:47,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2024-11-19 22:05:47,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 198 states have (on average 1.2676767676767677) internal successors, (251), 209 states have internal predecessors, (251), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44) [2024-11-19 22:05:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 324 transitions. [2024-11-19 22:05:47,171 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 324 transitions. Word has length 44 [2024-11-19 22:05:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:47,172 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 324 transitions. [2024-11-19 22:05:47,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 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:05:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions. [2024-11-19 22:05:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 22:05:47,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:47,174 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] [2024-11-19 22:05:47,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:05:47,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:47,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 299238822, now seen corresponding path program 1 times [2024-11-19 22:05:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753436567] [2024-11-19 22:05:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 22:05:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:05:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,298 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:05:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753436567] [2024-11-19 22:05:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753436567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:47,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:05:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955135504] [2024-11-19 22:05:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:47,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:47,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:47,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:05:47,305 INFO L87 Difference]: Start difference. First operand 257 states and 324 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:05:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:47,516 INFO L93 Difference]: Finished difference Result 504 states and 642 transitions. [2024-11-19 22:05:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:05:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-19 22:05:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:47,524 INFO L225 Difference]: With dead ends: 504 [2024-11-19 22:05:47,524 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 22:05:47,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:05:47,529 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 103 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:47,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 295 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 22:05:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2024-11-19 22:05:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 194 states have (on average 1.231958762886598) internal successors, (239), 205 states have internal predecessors, (239), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44) [2024-11-19 22:05:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 312 transitions. [2024-11-19 22:05:47,567 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 312 transitions. Word has length 46 [2024-11-19 22:05:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:47,567 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 312 transitions. [2024-11-19 22:05:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:05:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 312 transitions. [2024-11-19 22:05:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 22:05:47,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:47,569 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] [2024-11-19 22:05:47,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:05:47,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 657916201, now seen corresponding path program 1 times [2024-11-19 22:05:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289268478] [2024-11-19 22:05:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:05:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 22:05:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:47,641 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:05:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289268478] [2024-11-19 22:05:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289268478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:47,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:05:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447907830] [2024-11-19 22:05:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:47,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:05:47,645 INFO L87 Difference]: Start difference. First operand 253 states and 312 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:05:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:47,886 INFO L93 Difference]: Finished difference Result 470 states and 595 transitions. [2024-11-19 22:05:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:05:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-19 22:05:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:47,889 INFO L225 Difference]: With dead ends: 470 [2024-11-19 22:05:47,890 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 22:05:47,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:05:47,891 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 279 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:47,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 221 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:05:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 22:05:47,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 428. [2024-11-19 22:05:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 352 states have internal predecessors, (409), 48 states have call successors, (48), 42 states have call predecessors, (48), 48 states have return successors, (90), 47 states have call predecessors, (90), 48 states have call successors, (90) [2024-11-19 22:05:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 547 transitions. [2024-11-19 22:05:47,941 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 547 transitions. Word has length 48 [2024-11-19 22:05:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:47,942 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 547 transitions. [2024-11-19 22:05:47,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 22:05:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 547 transitions. [2024-11-19 22:05:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 22:05:47,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:47,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:47,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:05:47,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1908194548, now seen corresponding path program 1 times [2024-11-19 22:05:47,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149424529] [2024-11-19 22:05:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 22:05:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 22:05:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 22:05:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149424529] [2024-11-19 22:05:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149424529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597160055] [2024-11-19 22:05:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:48,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:05:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:05:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:05:48,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:48,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:48,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597160055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:48,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:48,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2024-11-19 22:05:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446880268] [2024-11-19 22:05:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:48,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:05:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:05:48,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:05:48,272 INFO L87 Difference]: Start difference. First operand 428 states and 547 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 22:05:48,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:48,317 INFO L93 Difference]: Finished difference Result 751 states and 975 transitions. [2024-11-19 22:05:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:05:48,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2024-11-19 22:05:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:48,322 INFO L225 Difference]: With dead ends: 751 [2024-11-19 22:05:48,322 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 22:05:48,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:05:48,324 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:48,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 22:05:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-19 22:05:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 293 states have (on average 1.2320819112627985) internal successors, (361), 312 states have internal predecessors, (361), 43 states have call successors, (43), 37 states have call predecessors, (43), 42 states have return successors, (68), 43 states have call predecessors, (68), 43 states have call successors, (68) [2024-11-19 22:05:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 472 transitions. [2024-11-19 22:05:48,358 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 472 transitions. Word has length 86 [2024-11-19 22:05:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:48,359 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 472 transitions. [2024-11-19 22:05:48,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-19 22:05:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 472 transitions. [2024-11-19 22:05:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 22:05:48,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:48,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:48,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 22:05:48,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 22:05:48,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:48,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1350194604, now seen corresponding path program 1 times [2024-11-19 22:05:48,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072537965] [2024-11-19 22:05:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:05:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 22:05:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 22:05:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:05:48,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072537965] [2024-11-19 22:05:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072537965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333089788] [2024-11-19 22:05:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:48,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:48,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:05:48,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:05:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:48,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 22:05:48,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-19 22:05:49,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:05:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 22:05:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333089788] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:49,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:05:49,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-19 22:05:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125034202] [2024-11-19 22:05:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:49,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:05:49,168 INFO L87 Difference]: Start difference. First operand 379 states and 472 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:05:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:49,292 INFO L93 Difference]: Finished difference Result 1061 states and 1357 transitions. [2024-11-19 22:05:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:05:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-19 22:05:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:49,298 INFO L225 Difference]: With dead ends: 1061 [2024-11-19 22:05:49,299 INFO L226 Difference]: Without dead ends: 690 [2024-11-19 22:05:49,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 22:05:49,301 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:49,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 397 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-19 22:05:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 640. [2024-11-19 22:05:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 488 states have (on average 1.2008196721311475) internal successors, (586), 522 states have internal predecessors, (586), 75 states have call successors, (75), 65 states have call predecessors, (75), 76 states have return successors, (119), 75 states have call predecessors, (119), 75 states have call successors, (119) [2024-11-19 22:05:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 780 transitions. [2024-11-19 22:05:49,389 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 780 transitions. Word has length 89 [2024-11-19 22:05:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:49,389 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 780 transitions. [2024-11-19 22:05:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 22:05:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 780 transitions. [2024-11-19 22:05:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:05:49,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:49,391 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:49,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:05:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 22:05:49,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1128084440, now seen corresponding path program 1 times [2024-11-19 22:05:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195623068] [2024-11-19 22:05:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 22:05:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:05:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 22:05:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 22:05:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:05:49,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:49,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195623068] [2024-11-19 22:05:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195623068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477663540] [2024-11-19 22:05:49,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:49,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:49,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:49,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:05:49,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:05:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:49,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 22:05:49,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:05:49,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477663540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-19 22:05:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328356061] [2024-11-19 22:05:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:49,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:05:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:05:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:05:49,972 INFO L87 Difference]: Start difference. First operand 640 states and 780 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 22:05:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:50,147 INFO L93 Difference]: Finished difference Result 1515 states and 1928 transitions. [2024-11-19 22:05:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:05:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-19 22:05:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:50,155 INFO L225 Difference]: With dead ends: 1515 [2024-11-19 22:05:50,155 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 22:05:50,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:05:50,158 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:50,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 523 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:05:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 22:05:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 903. [2024-11-19 22:05:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 686 states have (on average 1.2011661807580174) internal successors, (824), 733 states have internal predecessors, (824), 107 states have call successors, (107), 95 states have call predecessors, (107), 109 states have return successors, (173), 102 states have call predecessors, (173), 107 states have call successors, (173) [2024-11-19 22:05:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1104 transitions. [2024-11-19 22:05:50,251 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1104 transitions. Word has length 93 [2024-11-19 22:05:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1104 transitions. [2024-11-19 22:05:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 22:05:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1104 transitions. [2024-11-19 22:05:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:05:50,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:50,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:50,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 22:05:50,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:50,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 994070934, now seen corresponding path program 1 times [2024-11-19 22:05:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:05:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931605609] [2024-11-19 22:05:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:05:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 22:05:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 22:05:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 22:05:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:05:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:05:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 22:05:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:05:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 22:05:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 22:05:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:05:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931605609] [2024-11-19 22:05:50,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931605609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:05:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783391348] [2024-11-19 22:05:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:50,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:50,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:05:50,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 22:05:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:50,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:05:50,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 22:05:50,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783391348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:05:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 22:05:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130956118] [2024-11-19 22:05:50,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:50,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:05:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:05:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:05:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:05:50,714 INFO L87 Difference]: Start difference. First operand 903 states and 1104 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:05:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:50,754 INFO L93 Difference]: Finished difference Result 1237 states and 1508 transitions. [2024-11-19 22:05:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:05:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-19 22:05:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:50,757 INFO L225 Difference]: With dead ends: 1237 [2024-11-19 22:05:50,757 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:05:50,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:05:50,760 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:05:50,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:05:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:05:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:05:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:05:50,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-11-19 22:05:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:50,762 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:05:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:05:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:05:50,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:05:50,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:05:50,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 22:05:50,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:05:50,972 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:50,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:05:53,408 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:05:53,447 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (= ~methaneLevelCritical~0 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-11-19 22:05:53,451 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:169) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-19 22:05:53,455 INFO L158 Benchmark]: Toolchain (without parser) took 9635.10ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 122.9MB in the beginning and 85.7MB in the end (delta: 37.2MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,455 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:05:53,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.71ms. Allocated memory is still 155.2MB. Free memory was 122.9MB in the beginning and 101.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.58ms. Allocated memory is still 155.2MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,456 INFO L158 Benchmark]: Boogie Preprocessor took 47.77ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 96.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,456 INFO L158 Benchmark]: RCFGBuilder took 419.02ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 77.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,456 INFO L158 Benchmark]: TraceAbstraction took 8605.28ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 77.4MB in the beginning and 85.7MB in the end (delta: -8.3MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-11-19 22:05:53,459 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.71ms. Allocated memory is still 155.2MB. Free memory was 122.9MB in the beginning and 101.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.58ms. Allocated memory is still 155.2MB. Free memory was 101.0MB in the beginning and 98.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.77ms. Allocated memory is still 155.2MB. Free memory was 98.9MB in the beginning and 96.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.02ms. Allocated memory is still 155.2MB. Free memory was 96.3MB in the beginning and 77.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8605.28ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 77.4MB in the beginning and 85.7MB in the end (delta: -8.3MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 155]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155] - GenericResultAtLocation [Line: 264]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264] - GenericResultAtLocation [Line: 305]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305] - GenericResultAtLocation [Line: 370]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370] - GenericResultAtLocation [Line: 569]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569] - GenericResultAtLocation [Line: 935]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935] - GenericResultAtLocation [Line: 944]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944] * 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 - PositiveResult [Line: 940]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1164 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1139 mSDsluCounter, 3623 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2373 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 841 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 1250 mSDtfsCounter, 841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 551 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 184 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 2117 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 247/259 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 315]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 400]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ExceptionOrErrorResult: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))): de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-19 22:05:53,483 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_spec2_product49.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:05:55,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:05:55,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 22:05:55,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:05:55,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:05:55,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:05:55,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:05:55,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:05:55,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:05:55,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:05:55,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:05:55,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:05:55,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:05:55,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:05:55,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:05:55,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:05:55,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:05:55,783 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:05:55,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:05:55,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:05:55,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:05:55,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:05:55,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:05:55,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 22:05:55,788 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 22:05:55,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:05:55,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 22:05:55,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:05:55,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:05:55,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:05:55,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:05:55,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:05:55,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:05:55,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:05:55,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:55,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:05:55,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:05:55,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:05:55,793 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 22:05:55,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 22:05:55,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:05:55,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:05:55,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:05:55,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:05:55,795 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 -> 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d [2024-11-19 22:05:56,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:05:56,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:05:56,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:05:56,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:05:56,155 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:05:56,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c [2024-11-19 22:05:57,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:05:57,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:05:57,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c [2024-11-19 22:05:57,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fdd86c99/9a9c1c6994f04ee99211c7a6f41bfdde/FLAGded84fd06 [2024-11-19 22:05:58,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fdd86c99/9a9c1c6994f04ee99211c7a6f41bfdde [2024-11-19 22:05:58,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:05:58,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:05:58,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:58,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:05:58,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:05:58,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6532d3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58, skipping insertion in model container [2024-11-19 22:05:58,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:05:58,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,512 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,542 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,557 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 22:05:58,590 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_spec2_product49.cil.c[18359,18372] [2024-11-19 22:05:58,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:58,613 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:05:58,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-11-19 22:05:58,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155] [2024-11-19 22:05:58,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264] [2024-11-19 22:05:58,624 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305] [2024-11-19 22:05:58,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370] [2024-11-19 22:05:58,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569] [2024-11-19 22:05:58,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935] [2024-11-19 22:05:58,625 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944] [2024-11-19 22:05:58,697 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_spec2_product49.cil.c[18359,18372] [2024-11-19 22:05:58,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:05:58,727 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:05:58,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58 WrapperNode [2024-11-19 22:05:58,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:05:58,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:58,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:05:58,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:05:58,737 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:05:58" (1/1) ... [2024-11-19 22:05:58,761 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:05:58" (1/1) ... [2024-11-19 22:05:58,788 INFO L138 Inliner]: procedures = 58, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 195 [2024-11-19 22:05:58,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:05:58,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:05:58,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:05:58,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:05:58,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,831 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:05:58,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:05:58,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:05:58,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:05:58,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:05:58,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (1/1) ... [2024-11-19 22:05:58,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:05:58,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:05:58,892 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:05:58,900 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:05:58,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-19 22:05:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-19 22:05:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 22:05:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 22:05:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:58,947 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:05:58,947 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-19 22:05:58,948 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-19 22:05:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 22:05:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-19 22:05:58,949 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-19 22:05:58,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:05:58,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:05:59,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:05:59,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:05:59,351 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-19 22:05:59,351 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:05:59,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:05:59,371 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:05:59,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:59 BoogieIcfgContainer [2024-11-19 22:05:59,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:05:59,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:05:59,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:05:59,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:05:59,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:05:58" (1/3) ... [2024-11-19 22:05:59,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22b0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:59, skipping insertion in model container [2024-11-19 22:05:59,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:05:58" (2/3) ... [2024-11-19 22:05:59,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a22b0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:05:59, skipping insertion in model container [2024-11-19 22:05:59,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:59" (3/3) ... [2024-11-19 22:05:59,383 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product49.cil.c [2024-11-19 22:05:59,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:05:59,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:05:59,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:05:59,472 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;@afa60c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:05:59,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:05:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 22:05:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 22:05:59,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:59,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:05:59,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:05:59,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:05:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1277571174, now seen corresponding path program 1 times [2024-11-19 22:05:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:05:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845285289] [2024-11-19 22:05:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:05:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:05:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:05:59,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:05:59,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 22:05:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:05:59,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 22:05:59,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:05:59,657 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:05:59,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:05:59,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:05:59,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845285289] [2024-11-19 22:05:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845285289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:05:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:05:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:05:59,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709020403] [2024-11-19 22:05:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:05:59,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 22:05:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:05:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 22:05:59,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 22:05:59,694 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 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:05:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:05:59,730 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2024-11-19 22:05:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 22:05:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-19 22:05:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:05:59,742 INFO L225 Difference]: With dead ends: 167 [2024-11-19 22:05:59,742 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 22:05:59,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:05:59,752 INFO L432 NwaCegarLoop]: 111 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, 111 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:05:59,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:05:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 22:05:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 22:05:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 68 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 22:05:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-11-19 22:05:59,799 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 25 [2024-11-19 22:05:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:05:59,800 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-11-19 22:05:59,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 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:05:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-11-19 22:05:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 22:05:59,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:05:59,804 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] [2024-11-19 22:05:59,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 22:06:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:00,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -941221246, now seen corresponding path program 1 times [2024-11-19 22:06:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:00,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230300433] [2024-11-19 22:06:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:00,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:00,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 22:06:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:00,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:00,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:00,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:00,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:00,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230300433] [2024-11-19 22:06:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230300433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:00,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:00,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797947450] [2024-11-19 22:06:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:00,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:00,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:00,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:00,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:00,150 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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:06:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:00,170 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2024-11-19 22:06:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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 26 [2024-11-19 22:06:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:00,174 INFO L225 Difference]: With dead ends: 123 [2024-11-19 22:06:00,174 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 22:06:00,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:06:00,176 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 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:06:00,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 22:06:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 22:06:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:06:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-19 22:06:00,188 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 26 [2024-11-19 22:06:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-19 22:06:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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:06:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-19 22:06:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 22:06:00,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:00,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:00,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 22:06:00,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:00,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -913943674, now seen corresponding path program 1 times [2024-11-19 22:06:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125851596] [2024-11-19 22:06:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:00,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:00,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:00,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 22:06:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:00,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 22:06:00,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:06:00,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:00,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125851596] [2024-11-19 22:06:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125851596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:06:00,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943326884] [2024-11-19 22:06:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:00,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:00,526 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:00,538 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2024-11-19 22:06:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-19 22:06:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:00,540 INFO L225 Difference]: With dead ends: 132 [2024-11-19 22:06:00,540 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 22:06:00,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:06:00,542 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 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:06:00,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 22:06:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 22:06:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 22:06:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-19 22:06:00,555 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 30 [2024-11-19 22:06:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:00,556 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-19 22:06:00,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:06:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-19 22:06:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 22:06:00,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:00,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:00,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 22:06:00,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1798308510, now seen corresponding path program 1 times [2024-11-19 22:06:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268999934] [2024-11-19 22:06:00,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:00,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:00,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:00,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:00,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 22:06:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:00,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:06:00,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:00,964 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:06:00,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:00,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268999934] [2024-11-19 22:06:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268999934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268860019] [2024-11-19 22:06:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:00,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:06:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:06:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:06:00,973 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:06:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:01,245 INFO L93 Difference]: Finished difference Result 203 states and 260 transitions. [2024-11-19 22:06:01,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:06:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2024-11-19 22:06:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:01,249 INFO L225 Difference]: With dead ends: 203 [2024-11-19 22:06:01,249 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 22:06:01,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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:06:01,253 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 215 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:01,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 269 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:06:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 22:06:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2024-11-19 22:06:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 112 states have internal predecessors, (135), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-19 22:06:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2024-11-19 22:06:01,289 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 40 [2024-11-19 22:06:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:01,290 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2024-11-19 22:06:01,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:06:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2024-11-19 22:06:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:06:01,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:01,296 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] [2024-11-19 22:06:01,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 22:06:01,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:01,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1579167755, now seen corresponding path program 1 times [2024-11-19 22:06:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:01,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595340326] [2024-11-19 22:06:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:01,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 22:06:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:01,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:06:01,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:01,589 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:06:01,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:01,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595340326] [2024-11-19 22:06:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595340326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356902691] [2024-11-19 22:06:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:01,592 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:01,641 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2024-11-19 22:06:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:01,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-19 22:06:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:01,643 INFO L225 Difference]: With dead ends: 265 [2024-11-19 22:06:01,651 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 22:06:01,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:01,653 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:01,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 22:06:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-19 22:06:01,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-19 22:06:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions. [2024-11-19 22:06:01,684 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 44 [2024-11-19 22:06:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:01,684 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions. [2024-11-19 22:06:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions. [2024-11-19 22:06:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:06:01,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:01,685 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] [2024-11-19 22:06:01,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 22:06:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:01,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -109775987, now seen corresponding path program 1 times [2024-11-19 22:06:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469891965] [2024-11-19 22:06:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:01,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:01,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 22:06:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:01,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:01,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:01,967 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:06:01,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:01,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469891965] [2024-11-19 22:06:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469891965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:01,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:01,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:06:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791990955] [2024-11-19 22:06:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:01,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:06:01,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:06:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:06:01,970 INFO L87 Difference]: Start difference. First operand 138 states and 169 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:01,993 INFO L93 Difference]: Finished difference Result 270 states and 337 transitions. [2024-11-19 22:06:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:06:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-19 22:06:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:01,995 INFO L225 Difference]: With dead ends: 270 [2024-11-19 22:06:01,995 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 22:06:01,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:06:01,996 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:01,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 22:06:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-19 22:06:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 117 states have internal predecessors, (140), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-19 22:06:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2024-11-19 22:06:02,013 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 44 [2024-11-19 22:06:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:02,013 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2024-11-19 22:06:02,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2024-11-19 22:06:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 22:06:02,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:02,015 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] [2024-11-19 22:06:02,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 22:06:02,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:02,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:02,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 312925839, now seen corresponding path program 1 times [2024-11-19 22:06:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985669577] [2024-11-19 22:06:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:02,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:02,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:02,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 22:06:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:02,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:02,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:02,332 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:06:02,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:02,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985669577] [2024-11-19 22:06:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985669577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 22:06:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748481888] [2024-11-19 22:06:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:02,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:02,335 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:02,364 INFO L93 Difference]: Finished difference Result 321 states and 398 transitions. [2024-11-19 22:06:02,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-19 22:06:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:02,366 INFO L225 Difference]: With dead ends: 321 [2024-11-19 22:06:02,366 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 22:06:02,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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:06:02,367 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:02,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 22:06:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2024-11-19 22:06:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 154 states have internal predecessors, (184), 20 states have call successors, (20), 18 states have call predecessors, (20), 20 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-19 22:06:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2024-11-19 22:06:02,399 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 44 [2024-11-19 22:06:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2024-11-19 22:06:02,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 22:06:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2024-11-19 22:06:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 22:06:02,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:02,402 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] [2024-11-19 22:06:02,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:02,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:02,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash 299238822, now seen corresponding path program 1 times [2024-11-19 22:06:02,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:02,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147208747] [2024-11-19 22:06:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:02,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:02,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:02,606 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:02,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 22:06:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:02,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 22:06:02,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:02,778 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:06:02,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:02,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:02,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147208747] [2024-11-19 22:06:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147208747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:02,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:02,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18393020] [2024-11-19 22:06:02,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:02,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:06:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:02,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:06:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:06:02,781 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 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:06:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:02,899 INFO L93 Difference]: Finished difference Result 528 states and 650 transitions. [2024-11-19 22:06:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:06:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 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 46 [2024-11-19 22:06:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:02,903 INFO L225 Difference]: With dead ends: 528 [2024-11-19 22:06:02,904 INFO L226 Difference]: Without dead ends: 349 [2024-11-19 22:06:02,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:06:02,906 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:02,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 403 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:06:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-19 22:06:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-19 22:06:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 268 states have (on average 1.2164179104477613) internal successors, (326), 283 states have internal predecessors, (326), 40 states have call successors, (40), 36 states have call predecessors, (40), 40 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2024-11-19 22:06:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 415 transitions. [2024-11-19 22:06:02,953 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 415 transitions. Word has length 46 [2024-11-19 22:06:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:02,953 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 415 transitions. [2024-11-19 22:06:02,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 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:06:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 415 transitions. [2024-11-19 22:06:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 22:06:02,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:02,955 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] [2024-11-19 22:06:02,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:03,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:03,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:03,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -658311774, now seen corresponding path program 1 times [2024-11-19 22:06:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263843810] [2024-11-19 22:06:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:03,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:03,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:03,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 22:06:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:03,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 22:06:03,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:03,302 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:06:03,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:03,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:03,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263843810] [2024-11-19 22:06:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263843810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:03,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:03,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:06:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618773012] [2024-11-19 22:06:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:03,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:06:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:06:03,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:06:03,311 INFO L87 Difference]: Start difference. First operand 349 states and 415 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 22:06:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:03,516 INFO L93 Difference]: Finished difference Result 689 states and 820 transitions. [2024-11-19 22:06:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 22:06:03,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2024-11-19 22:06:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:03,521 INFO L225 Difference]: With dead ends: 689 [2024-11-19 22:06:03,522 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 22:06:03,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:06:03,523 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:03,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 295 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:06:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 22:06:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-11-19 22:06:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 265 states have (on average 1.1962264150943396) internal successors, (317), 280 states have internal predecessors, (317), 40 states have call successors, (40), 36 states have call predecessors, (40), 40 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49) [2024-11-19 22:06:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 406 transitions. [2024-11-19 22:06:03,575 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 406 transitions. Word has length 50 [2024-11-19 22:06:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 406 transitions. [2024-11-19 22:06:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 22:06:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 406 transitions. [2024-11-19 22:06:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 22:06:03,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:03,577 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, 1] [2024-11-19 22:06:03,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:03,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:03,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1829706971, now seen corresponding path program 1 times [2024-11-19 22:06:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623790649] [2024-11-19 22:06:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:03,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:03,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:03,785 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:03,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 22:06:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:03,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 22:06:03,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:03,914 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:06:03,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:03,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623790649] [2024-11-19 22:06:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623790649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:06:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649408411] [2024-11-19 22:06:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:03,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:06:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:06:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:06:03,919 INFO L87 Difference]: Start difference. First operand 346 states and 406 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:06:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:03,973 INFO L93 Difference]: Finished difference Result 453 states and 535 transitions. [2024-11-19 22:06:03,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:06:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2024-11-19 22:06:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:03,978 INFO L225 Difference]: With dead ends: 453 [2024-11-19 22:06:03,978 INFO L226 Difference]: Without dead ends: 451 [2024-11-19 22:06:03,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:06:03,979 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:03,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-19 22:06:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2024-11-19 22:06:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 337 states have (on average 1.198813056379822) internal successors, (404), 358 states have internal predecessors, (404), 52 states have call successors, (52), 48 states have call predecessors, (52), 53 states have return successors, (67), 49 states have call predecessors, (67), 52 states have call successors, (67) [2024-11-19 22:06:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 523 transitions. [2024-11-19 22:06:04,023 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 523 transitions. Word has length 52 [2024-11-19 22:06:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:04,023 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 523 transitions. [2024-11-19 22:06:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:06:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 523 transitions. [2024-11-19 22:06:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:06:04,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:04,026 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 22:06:04,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:04,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1780679462, now seen corresponding path program 1 times [2024-11-19 22:06:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316202400] [2024-11-19 22:06:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:04,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:04,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 22:06:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:04,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 22:06:04,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:06:04,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:06:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 22:06:04,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316202400] [2024-11-19 22:06:04,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316202400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:06:04,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:06:04,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2024-11-19 22:06:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214892677] [2024-11-19 22:06:04,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 22:06:04,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:06:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:06:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:06:04,734 INFO L87 Difference]: Start difference. First operand 443 states and 523 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 22:06:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:05,322 INFO L93 Difference]: Finished difference Result 1560 states and 1974 transitions. [2024-11-19 22:06:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:06:05,323 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 93 [2024-11-19 22:06:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:05,331 INFO L225 Difference]: With dead ends: 1560 [2024-11-19 22:06:05,331 INFO L226 Difference]: Without dead ends: 1215 [2024-11-19 22:06:05,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:06:05,334 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 682 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:05,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 411 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:06:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-19 22:06:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1131. [2024-11-19 22:06:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 866 states have (on average 1.199769053117783) internal successors, (1039), 921 states have internal predecessors, (1039), 131 states have call successors, (131), 117 states have call predecessors, (131), 133 states have return successors, (203), 122 states have call predecessors, (203), 131 states have call successors, (203) [2024-11-19 22:06:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1373 transitions. [2024-11-19 22:06:05,480 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1373 transitions. Word has length 93 [2024-11-19 22:06:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:05,480 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1373 transitions. [2024-11-19 22:06:05,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 22:06:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1373 transitions. [2024-11-19 22:06:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:06:05,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:05,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:05,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 22:06:05,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:05,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1128084440, now seen corresponding path program 1 times [2024-11-19 22:06:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995410046] [2024-11-19 22:06:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:05,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:05,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 22:06:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:05,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 22:06:05,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 22:06:05,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:06:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 22:06:06,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:06,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995410046] [2024-11-19 22:06:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995410046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:06:06,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:06:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-19 22:06:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901938412] [2024-11-19 22:06:06,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 22:06:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:06:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:06:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:06:06,187 INFO L87 Difference]: Start difference. First operand 1131 states and 1373 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 22:06:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:07,193 INFO L93 Difference]: Finished difference Result 4110 states and 5236 transitions. [2024-11-19 22:06:07,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:06:07,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 93 [2024-11-19 22:06:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:07,210 INFO L225 Difference]: With dead ends: 4110 [2024-11-19 22:06:07,210 INFO L226 Difference]: Without dead ends: 3073 [2024-11-19 22:06:07,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-11-19 22:06:07,215 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 661 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:07,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 717 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:06:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2024-11-19 22:06:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2707. [2024-11-19 22:06:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2707 states, 2073 states have (on average 1.1987457790641582) internal successors, (2485), 2191 states have internal predecessors, (2485), 318 states have call successors, (318), 296 states have call predecessors, (318), 315 states have return successors, (520), 291 states have call predecessors, (520), 318 states have call successors, (520) [2024-11-19 22:06:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 3323 transitions. [2024-11-19 22:06:07,491 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 3323 transitions. Word has length 93 [2024-11-19 22:06:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:07,491 INFO L471 AbstractCegarLoop]: Abstraction has 2707 states and 3323 transitions. [2024-11-19 22:06:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-19 22:06:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3323 transitions. [2024-11-19 22:06:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 22:06:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:06:07,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:07,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 22:06:07,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:07,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:06:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:06:07,696 INFO L85 PathProgramCache]: Analyzing trace with hash 994070934, now seen corresponding path program 1 times [2024-11-19 22:06:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 22:06:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581324283] [2024-11-19 22:06:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:06:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 22:06:07,698 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 22:06:07,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 22:06:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:06:07,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:06:07,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:06:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 22:06:07,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:06:07,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 22:06:07,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581324283] [2024-11-19 22:06:07,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581324283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:06:07,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:06:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:06:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534653249] [2024-11-19 22:06:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:06:07,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:06:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 22:06:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:06:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:07,795 INFO L87 Difference]: Start difference. First operand 2707 states and 3323 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:06:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:06:07,852 INFO L93 Difference]: Finished difference Result 3069 states and 3745 transitions. [2024-11-19 22:06:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:06:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-19 22:06:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:06:07,855 INFO L225 Difference]: With dead ends: 3069 [2024-11-19 22:06:07,855 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 22:06:07,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:06:07,864 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:06:07,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:06:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 22:06:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 22:06:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:06:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 22:06:07,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-11-19 22:06:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:06:07,868 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 22:06:07,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:06:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 22:06:07,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 22:06:07,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 22:06:07,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 22:06:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 22:06:08,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:06:08,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 22:06:10,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 22:06:10,231 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32)))) (and (or (not .cse0) (not (= (_ bv0 32) |old(~methaneLevelCritical~0)|)) (= ~methaneLevelCritical~0 (_ bv0 32))) (let ((.cse2 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse1 (not .cse2) .cse3) (and (= ~waterLevel~0 (_ bv1 32)) .cse2 .cse0 .cse3) (and .cse1 .cse0 .cse3))))) Eliminated clause: (let ((.cse1 (= (_ bv0 32) ~pumpRunning~0)) (.cse0 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 (not .cse1) .cse2) (and (= ~waterLevel~0 (_ bv1 32)) .cse1 .cse3 .cse2) (and .cse0 .cse3 .cse2))) [2024-11-19 22:06:10,254 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv1 32) |old(~waterLevel~0)|))) (and (let ((.cse3 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse2) (and (not .cse3) .cse1 .cse2))) (or (not .cse0) (= ~methAndRunningLastTime~0 (_ bv0 32))) (or (and (= |old(~pumpRunning~0)| ~pumpRunning~0) (= ~waterLevel~0 (_ bv2 32))) (not .cse1)) (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv0 32) ~pumpRunning~0)) (not .cse4)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse0 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv1 32) |old(~waterLevel~0)|))) (and (let ((.cse3 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse2) (and (not .cse3) .cse1 .cse2))) (or (not .cse0) (= ~methAndRunningLastTime~0 (_ bv0 32))) (or (and (= |old(~pumpRunning~0)| ~pumpRunning~0) (= ~waterLevel~0 (_ bv2 32))) (not .cse1)) (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv0 32) ~pumpRunning~0)) (not .cse4))))) [2024-11-19 22:06:10,271 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 22:06:10,278 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse0 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 (= ~waterLevel~0 (_ bv2 32)) .cse1 .cse2) (and (= ~waterLevel~0 (_ bv1 32)) .cse0 .cse1 .cse2)))) Eliminated clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ~systemActive~0))) (or (and (= ~waterLevel~0 (_ bv2 32)) .cse0 .cse1) (and (= ~waterLevel~0 (_ bv1 32)) .cse0 .cse1)))) [2024-11-19 22:06:10,293 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse1 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (let ((.cse0 (= (_ bv0 32) ~pumpRunning~0)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not .cse0) .cse4 .cse3) (and .cse2 .cse4 .cse3))) (or (= ~waterLevel~0 (_ bv1 32)) (not .cse1)) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse4)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32))) (let ((.cse1 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (let ((.cse0 (= (_ bv0 32) ~pumpRunning~0)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not .cse0) .cse4 .cse3) (and .cse2 .cse4 .cse3))) (or (= ~waterLevel~0 (_ bv1 32)) (not .cse1)) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse4))))) [2024-11-19 22:06:10,297 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-19 22:06:10,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:06:10 BoogieIcfgContainer [2024-11-19 22:06:10,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 22:06:10,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 22:06:10,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 22:06:10,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 22:06:10,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:05:59" (3/4) ... [2024-11-19 22:06:10,302 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 22:06:10,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-19 22:06:10,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-19 22:06:10,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-19 22:06:10,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-19 22:06:10,306 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-19 22:06:10,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-19 22:06:10,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-19 22:06:10,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-19 22:06:10,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-19 22:06:10,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 22:06:10,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:06:10,318 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 22:06:10,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 22:06:10,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 22:06:10,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 22:06:10,444 INFO L158 Benchmark]: Toolchain (without parser) took 12273.98ms. Allocated memory was 56.6MB in the beginning and 247.5MB in the end (delta: 190.8MB). Free memory was 24.3MB in the beginning and 118.3MB in the end (delta: -94.0MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,444 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 41.9MB. Free memory is still 18.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 22:06:10,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 24.0MB in the beginning and 41.3MB in the end (delta: -17.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.78ms. Allocated memory is still 69.2MB. Free memory was 41.3MB in the beginning and 39.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,445 INFO L158 Benchmark]: Boogie Preprocessor took 64.08ms. Allocated memory is still 69.2MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,445 INFO L158 Benchmark]: RCFGBuilder took 514.67ms. Allocated memory is still 69.2MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 79.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,446 INFO L158 Benchmark]: TraceAbstraction took 10923.59ms. Allocated memory was 69.2MB in the beginning and 247.5MB in the end (delta: 178.3MB). Free memory was 35.7MB in the beginning and 125.6MB in the end (delta: -89.9MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,446 INFO L158 Benchmark]: Witness Printer took 144.22ms. Allocated memory is still 247.5MB. Free memory was 125.6MB in the beginning and 118.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 22:06:10,448 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.18ms. Allocated memory is still 41.9MB. Free memory is still 18.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 24.0MB in the beginning and 41.3MB in the end (delta: -17.2MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.78ms. Allocated memory is still 69.2MB. Free memory was 41.3MB in the beginning and 39.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.08ms. Allocated memory is still 69.2MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.67ms. Allocated memory is still 69.2MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 79.1kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10923.59ms. Allocated memory was 69.2MB in the beginning and 247.5MB in the end (delta: 178.3MB). Free memory was 35.7MB in the beginning and 125.6MB in the end (delta: -89.9MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. * Witness Printer took 144.22ms. Allocated memory is still 247.5MB. Free memory was 125.6MB in the beginning and 118.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 155]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155] - GenericResultAtLocation [Line: 264]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264] - GenericResultAtLocation [Line: 305]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305] - GenericResultAtLocation [Line: 370]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370] - GenericResultAtLocation [Line: 569]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569] - GenericResultAtLocation [Line: 935]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935] - GenericResultAtLocation [Line: 944]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 940]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1884 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1854 mSDsluCounter, 3657 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2458 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1129 IncrementalHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 1199 mSDtfsCounter, 1129 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 890 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2707occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 468 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 1952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1565 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 113/135 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 315]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: ((((((waterLevel == 2) && (0 != pumpRunning)) && (0 == splverifierCounter)) && (1 == systemActive)) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 400]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 188]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((waterLevel == 2) && (0 != pumpRunning)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((((waterLevel == 2) && (0 != pumpRunning)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 200]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive)) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((methaneLevelCritical != 0) || (0 == \result)) && ((((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive)) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 376]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((1 != \old(waterLevel)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0))) && ((methaneLevelCritical != 0) || (methAndRunningLastTime == 0))) && (((((0 == \old(methAndRunningLastTime)) && (2 == \old(waterLevel))) && (1 == systemActive)) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (1 == systemActive))) || (((0 != \old(pumpRunning)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && (((((waterLevel == 2) && (methAndRunningLastTime == 0)) || (0 != \old(pumpRunning))) || (2 != \old(waterLevel))) || ((waterLevel == 2) && (0 != pumpRunning)))) && ((0 == \old(pumpRunning)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 52]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 408]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((0 == pumpRunning) && ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || (((waterLevel == 1) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) Ensures: ((((0 == pumpRunning) || (waterLevel != 1)) && (((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (systemActive == \old(systemActive))) && (head == \old(head)))) - ProcedureContractResult [Line: 176]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: ((((((((0 == pumpRunning) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || (((0 != pumpRunning) && (2 == \old(waterLevel))) && (1 == systemActive))) || (((methAndRunningLastTime == 0) && (2 == \old(waterLevel))) && (1 == systemActive))) && (waterLevel == 2)) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-19 22:06:10,470 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 Result: TRUE