./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product50.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/product-lines/minepump_spec4_product50.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 d44823aac48cec2911f68e219166f3ac1836e56b97e3a905bce4580d699376f2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:05:49,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:05:49,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:05:49,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:05:49,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:05:49,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:05:49,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:05:49,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:05:49,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:05:49,712 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:05:49,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:05:49,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:05:49,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:05:49,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:05:49,714 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:05:49,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:05:49,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:05:49,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:05:49,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:05:49,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:05:49,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:05:49,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:05:49,722 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:05:49,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:05:49,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:05:49,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:05:49,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:05:49,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:05:49,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:05:49,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:05:49,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:05:49,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:05:49,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:05:49,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:05:49,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:05:49,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:05:49,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:05:49,730 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 -> d44823aac48cec2911f68e219166f3ac1836e56b97e3a905bce4580d699376f2 [2024-11-22 02:05:50,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:05:50,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:05:50,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:05:50,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:05:50,170 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:05:50,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product50.cil.c [2024-11-22 02:05:51,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:05:51,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:05:51,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product50.cil.c [2024-11-22 02:05:51,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228f407d0/cdf7810d31a242fc9f9dae3ef90ebdef/FLAG02c332d8d [2024-11-22 02:05:51,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/228f407d0/cdf7810d31a242fc9f9dae3ef90ebdef [2024-11-22 02:05:51,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:05:51,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:05:51,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:05:51,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:05:51,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:05:51,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:05:51" (1/1) ... [2024-11-22 02:05:51,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec397b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:51, skipping insertion in model container [2024-11-22 02:05:51,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:05:51" (1/1) ... [2024-11-22 02:05:52,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:05:52,273 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_spec4_product50.cil.c[13010,13023] [2024-11-22 02:05:52,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:05:52,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:05:52,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-22 02:05:52,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [415] [2024-11-22 02:05:52,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] [2024-11-22 02:05:52,340 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [548] [2024-11-22 02:05:52,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [557] [2024-11-22 02:05:52,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] [2024-11-22 02:05:52,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [700] [2024-11-22 02:05:52,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [908] [2024-11-22 02:05:52,385 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_spec4_product50.cil.c[13010,13023] [2024-11-22 02:05:52,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:05:52,419 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:05:52,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52 WrapperNode [2024-11-22 02:05:52,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:05:52,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:05:52,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:05:52,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:05:52,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,465 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 207 [2024-11-22 02:05:52,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:05:52,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:05:52,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:05:52,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:05:52,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,503 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-22 02:05:52,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:05:52,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:05:52,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:05:52,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:05:52,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (1/1) ... [2024-11-22 02:05:52,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:05:52,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:05:52,593 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-22 02:05:52,596 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-22 02:05:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:05:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-22 02:05:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-22 02:05:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-22 02:05:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-22 02:05:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-22 02:05:52,641 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-22 02:05:52,641 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-22 02:05:52,642 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-22 02:05:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-22 02:05:52,642 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-22 02:05:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:05:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-22 02:05:52,642 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-22 02:05:52,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:05:52,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:05:52,730 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:05:52,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:05:53,048 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-22 02:05:53,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:05:53,061 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:05:53,062 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 02:05:53,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:05:53 BoogieIcfgContainer [2024-11-22 02:05:53,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:05:53,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:05:53,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:05:53,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:05:53,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:05:51" (1/3) ... [2024-11-22 02:05:53,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:05:53, skipping insertion in model container [2024-11-22 02:05:53,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:05:52" (2/3) ... [2024-11-22 02:05:53,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:05:53, skipping insertion in model container [2024-11-22 02:05:53,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:05:53" (3/3) ... [2024-11-22 02:05:53,070 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product50.cil.c [2024-11-22 02:05:53,084 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:05:53,084 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:05:53,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:05:53,136 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;@3ee7bca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:05:53,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:05:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 65 states have (on average 1.4) internal successors, (91), 73 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 02:05:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 02:05:53,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:53,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:05:53,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash -340967460, now seen corresponding path program 1 times [2024-11-22 02:05:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742905723] [2024-11-22 02:05:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:53,299 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-22 02:05:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742905723] [2024-11-22 02:05:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742905723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 02:05:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362186401] [2024-11-22 02:05:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:53,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 02:05:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 02:05:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 02:05:53,325 INFO L87 Difference]: Start difference. First operand has 83 states, 65 states have (on average 1.4) internal successors, (91), 73 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:53,347 INFO L93 Difference]: Finished difference Result 158 states and 217 transitions. [2024-11-22 02:05:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 02:05:53,349 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 02:05:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:53,356 INFO L225 Difference]: With dead ends: 158 [2024-11-22 02:05:53,357 INFO L226 Difference]: Without dead ends: 74 [2024-11-22 02:05:53,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 02:05:53,364 INFO L432 NwaCegarLoop]: 105 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, 105 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-22 02:05:53,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-22 02:05:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-22 02:05:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 02:05:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2024-11-22 02:05:53,438 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 19 [2024-11-22 02:05:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2024-11-22 02:05:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2024-11-22 02:05:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 02:05:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:53,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:05:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:05:53,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1018100204, now seen corresponding path program 1 times [2024-11-22 02:05:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071029984] [2024-11-22 02:05:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:53,522 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-22 02:05:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071029984] [2024-11-22 02:05:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071029984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:05:53,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328710228] [2024-11-22 02:05:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:05:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:05:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:05:53,525 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:53,536 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2024-11-22 02:05:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:05:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 02:05:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:53,538 INFO L225 Difference]: With dead ends: 113 [2024-11-22 02:05:53,538 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 02:05:53,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:05:53,539 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 149 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-22 02:05:53,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 02:05:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 02:05:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 59 states have internal predecessors, (70), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 02:05:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-11-22 02:05:53,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 20 [2024-11-22 02:05:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:53,547 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-11-22 02:05:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-11-22 02:05:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 02:05:53,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:53,548 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-22 02:05:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:05:53,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2024480710, now seen corresponding path program 1 times [2024-11-22 02:05:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161073462] [2024-11-22 02:05:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:53,673 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-22 02:05:53,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161073462] [2024-11-22 02:05:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161073462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:53,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:53,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347926155] [2024-11-22 02:05:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:05:53,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:05:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:05:53,676 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:53,767 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2024-11-22 02:05:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:05:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 02:05:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:53,769 INFO L225 Difference]: With dead ends: 123 [2024-11-22 02:05:53,769 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 02:05:53,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-22 02:05:53,771 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 79 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:53,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 206 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 02:05:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 02:05:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 59 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 02:05:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-11-22 02:05:53,791 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 25 [2024-11-22 02:05:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-11-22 02:05:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 02:05:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-22 02:05:53,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 02:05:53,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:53,794 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] [2024-11-22 02:05:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 02:05:53,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1530438702, now seen corresponding path program 1 times [2024-11-22 02:05:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115615453] [2024-11-22 02:05:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:53,889 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-22 02:05:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115615453] [2024-11-22 02:05:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115615453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:53,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486052007] [2024-11-22 02:05:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:53,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:53,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:53,893 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:05:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:54,063 INFO L93 Difference]: Finished difference Result 186 states and 238 transitions. [2024-11-22 02:05:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 02:05:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-22 02:05:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:54,065 INFO L225 Difference]: With dead ends: 186 [2024-11-22 02:05:54,065 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 02:05:54,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-22 02:05:54,068 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 149 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:54,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 257 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 02:05:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-11-22 02:05:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 105 states have internal predecessors, (125), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-11-22 02:05:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2024-11-22 02:05:54,083 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 35 [2024-11-22 02:05:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:54,084 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2024-11-22 02:05:54,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:05:54,084 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2024-11-22 02:05:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:05:54,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:54,085 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] [2024-11-22 02:05:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 02:05:54,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 699766483, now seen corresponding path program 1 times [2024-11-22 02:05:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580623463] [2024-11-22 02:05:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:54,223 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-22 02:05:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580623463] [2024-11-22 02:05:54,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580623463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:54,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:54,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 02:05:54,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926376435] [2024-11-22 02:05:54,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:54,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 02:05:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 02:05:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 02:05:54,225 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:54,348 INFO L93 Difference]: Finished difference Result 428 states and 562 transitions. [2024-11-22 02:05:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 02:05:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-22 02:05:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:54,355 INFO L225 Difference]: With dead ends: 428 [2024-11-22 02:05:54,355 INFO L226 Difference]: Without dead ends: 313 [2024-11-22 02:05:54,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-22 02:05:54,357 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 111 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:54,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 251 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-22 02:05:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 235. [2024-11-22 02:05:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 188 states have (on average 1.2659574468085106) internal successors, (238), 201 states have internal predecessors, (238), 20 states have call successors, (20), 20 states have call predecessors, (20), 26 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-11-22 02:05:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2024-11-22 02:05:54,408 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 39 [2024-11-22 02:05:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2024-11-22 02:05:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2024-11-22 02:05:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:05:54,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:54,409 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] [2024-11-22 02:05:54,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 02:05:54,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:54,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1720834837, now seen corresponding path program 1 times [2024-11-22 02:05:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:54,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402651460] [2024-11-22 02:05:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:54,498 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-22 02:05:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402651460] [2024-11-22 02:05:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402651460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618074523] [2024-11-22 02:05:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:54,504 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:54,545 INFO L93 Difference]: Finished difference Result 469 states and 591 transitions. [2024-11-22 02:05:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:05:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-22 02:05:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:54,547 INFO L225 Difference]: With dead ends: 469 [2024-11-22 02:05:54,547 INFO L226 Difference]: Without dead ends: 241 [2024-11-22 02:05:54,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:05:54,552 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 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-22 02:05:54,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-22 02:05:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-22 02:05:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 194 states have (on average 1.2577319587628866) internal successors, (244), 207 states have internal predecessors, (244), 20 states have call successors, (20), 20 states have call predecessors, (20), 26 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-11-22 02:05:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2024-11-22 02:05:54,589 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 39 [2024-11-22 02:05:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2024-11-22 02:05:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2024-11-22 02:05:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:05:54,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:54,592 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] [2024-11-22 02:05:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 02:05:54,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 709717587, now seen corresponding path program 1 times [2024-11-22 02:05:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467761753] [2024-11-22 02:05:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:54,698 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-22 02:05:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:54,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467761753] [2024-11-22 02:05:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467761753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:54,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:54,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 02:05:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721206485] [2024-11-22 02:05:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:54,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 02:05:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 02:05:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 02:05:54,701 INFO L87 Difference]: Start difference. First operand 241 states and 298 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:54,721 INFO L93 Difference]: Finished difference Result 443 states and 554 transitions. [2024-11-22 02:05:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 02:05:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-22 02:05:54,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:54,724 INFO L225 Difference]: With dead ends: 443 [2024-11-22 02:05:54,724 INFO L226 Difference]: Without dead ends: 209 [2024-11-22 02:05:54,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-22 02:05:54,726 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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-22 02:05:54,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-22 02:05:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 172. [2024-11-22 02:05:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 147 states have internal predecessors, (172), 15 states have call successors, (15), 15 states have call predecessors, (15), 18 states have return successors, (21), 15 states have call predecessors, (21), 15 states have call successors, (21) [2024-11-22 02:05:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2024-11-22 02:05:54,741 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 39 [2024-11-22 02:05:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:54,742 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2024-11-22 02:05:54,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:05:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2024-11-22 02:05:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 02:05:54,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:54,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:05:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 02:05:54,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 11284582, now seen corresponding path program 1 times [2024-11-22 02:05:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748897022] [2024-11-22 02:05:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:54,861 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-22 02:05:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748897022] [2024-11-22 02:05:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748897022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 02:05:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630723052] [2024-11-22 02:05:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:54,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 02:05:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 02:05:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 02:05:54,865 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:05:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:55,030 INFO L93 Difference]: Finished difference Result 426 states and 540 transitions. [2024-11-22 02:05:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 02:05:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-22 02:05:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:55,031 INFO L225 Difference]: With dead ends: 426 [2024-11-22 02:05:55,031 INFO L226 Difference]: Without dead ends: 261 [2024-11-22 02:05:55,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-22 02:05:55,032 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 132 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:55,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 506 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-22 02:05:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2024-11-22 02:05:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 218 states have internal predecessors, (250), 23 states have call successors, (23), 23 states have call predecessors, (23), 28 states have return successors, (40), 25 states have call predecessors, (40), 23 states have call successors, (40) [2024-11-22 02:05:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 313 transitions. [2024-11-22 02:05:55,053 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 313 transitions. Word has length 41 [2024-11-22 02:05:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:55,053 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 313 transitions. [2024-11-22 02:05:55,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:05:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 313 transitions. [2024-11-22 02:05:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 02:05:55,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:55,054 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 02:05:55,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 02:05:55,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1365828969, now seen corresponding path program 1 times [2024-11-22 02:05:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:55,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875921931] [2024-11-22 02:05:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-22 02:05:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875921931] [2024-11-22 02:05:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875921931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530562736] [2024-11-22 02:05:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:55,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:55,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:55,126 INFO L87 Difference]: Start difference. First operand 257 states and 313 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 02:05:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:55,157 INFO L93 Difference]: Finished difference Result 472 states and 583 transitions. [2024-11-22 02:05:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:05:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2024-11-22 02:05:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:55,159 INFO L225 Difference]: With dead ends: 472 [2024-11-22 02:05:55,159 INFO L226 Difference]: Without dead ends: 263 [2024-11-22 02:05:55,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:05:55,160 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:55,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-22 02:05:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-22 02:05:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 211 states have (on average 1.2132701421800949) internal successors, (256), 224 states have internal predecessors, (256), 23 states have call successors, (23), 23 states have call predecessors, (23), 28 states have return successors, (40), 25 states have call predecessors, (40), 23 states have call successors, (40) [2024-11-22 02:05:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 319 transitions. [2024-11-22 02:05:55,177 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 319 transitions. Word has length 71 [2024-11-22 02:05:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:55,178 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 319 transitions. [2024-11-22 02:05:55,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 02:05:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 319 transitions. [2024-11-22 02:05:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 02:05:55,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:55,179 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 02:05:55,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 02:05:55,179 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:55,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1623994407, now seen corresponding path program 1 times [2024-11-22 02:05:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362843539] [2024-11-22 02:05:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-22 02:05:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362843539] [2024-11-22 02:05:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362843539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479812752] [2024-11-22 02:05:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:55,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:55,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:55,246 INFO L87 Difference]: Start difference. First operand 263 states and 319 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 02:05:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:55,320 INFO L93 Difference]: Finished difference Result 265 states and 320 transitions. [2024-11-22 02:05:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:05:55,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2024-11-22 02:05:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:55,323 INFO L225 Difference]: With dead ends: 265 [2024-11-22 02:05:55,323 INFO L226 Difference]: Without dead ends: 263 [2024-11-22 02:05:55,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-22 02:05:55,323 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:55,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 286 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-22 02:05:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-22 02:05:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 211 states have (on average 1.2037914691943128) internal successors, (254), 224 states have internal predecessors, (254), 23 states have call successors, (23), 23 states have call predecessors, (23), 28 states have return successors, (40), 25 states have call predecessors, (40), 23 states have call successors, (40) [2024-11-22 02:05:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 317 transitions. [2024-11-22 02:05:55,363 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 317 transitions. Word has length 71 [2024-11-22 02:05:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:55,363 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 317 transitions. [2024-11-22 02:05:55,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 02:05:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 317 transitions. [2024-11-22 02:05:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 02:05:55,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:55,364 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-22 02:05:55,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 02:05:55,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1050725005, now seen corresponding path program 1 times [2024-11-22 02:05:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964392077] [2024-11-22 02:05:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 02:05:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964392077] [2024-11-22 02:05:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964392077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:05:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475598755] [2024-11-22 02:05:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:55,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:05:55,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:05:55,615 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-22 02:05:55,616 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-22 02:05:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:55,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:05:55,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:05:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:05:55,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:05:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 02:05:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475598755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:05:56,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:05:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-22 02:05:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097711434] [2024-11-22 02:05:56,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:05:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 02:05:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 02:05:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 02:05:56,075 INFO L87 Difference]: Start difference. First operand 263 states and 317 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 02:05:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:56,260 INFO L93 Difference]: Finished difference Result 575 states and 745 transitions. [2024-11-22 02:05:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 02:05:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2024-11-22 02:05:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:56,262 INFO L225 Difference]: With dead ends: 575 [2024-11-22 02:05:56,262 INFO L226 Difference]: Without dead ends: 360 [2024-11-22 02:05:56,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 150 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-22 02:05:56,264 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 76 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:56,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 582 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-22 02:05:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 329. [2024-11-22 02:05:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 260 states have (on average 1.2115384615384615) internal successors, (315), 276 states have internal predecessors, (315), 33 states have call successors, (33), 33 states have call predecessors, (33), 35 states have return successors, (58), 31 states have call predecessors, (58), 33 states have call successors, (58) [2024-11-22 02:05:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 406 transitions. [2024-11-22 02:05:56,290 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 406 transitions. Word has length 78 [2024-11-22 02:05:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 406 transitions. [2024-11-22 02:05:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-22 02:05:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 406 transitions. [2024-11-22 02:05:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 02:05:56,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:56,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 02:05:56,300 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-22 02:05:56,493 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,SelfDestructingSolverStorable10 [2024-11-22 02:05:56,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1937588267, now seen corresponding path program 2 times [2024-11-22 02:05:56,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:56,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881913655] [2024-11-22 02:05:56,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:05:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:56,515 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:05:56,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:05:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 02:05:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881913655] [2024-11-22 02:05:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881913655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:56,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511498737] [2024-11-22 02:05:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:56,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:56,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:56,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:56,660 INFO L87 Difference]: Start difference. First operand 329 states and 406 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 02:05:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:56,785 INFO L93 Difference]: Finished difference Result 784 states and 995 transitions. [2024-11-22 02:05:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 02:05:56,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 113 [2024-11-22 02:05:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:56,788 INFO L225 Difference]: With dead ends: 784 [2024-11-22 02:05:56,788 INFO L226 Difference]: Without dead ends: 502 [2024-11-22 02:05:56,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-22 02:05:56,789 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:56,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 420 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:05:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-22 02:05:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2024-11-22 02:05:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 385 states have (on average 1.2025974025974027) internal successors, (463), 405 states have internal predecessors, (463), 51 states have call successors, (51), 51 states have call predecessors, (51), 51 states have return successors, (82), 46 states have call predecessors, (82), 51 states have call successors, (82) [2024-11-22 02:05:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 596 transitions. [2024-11-22 02:05:56,815 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 596 transitions. Word has length 113 [2024-11-22 02:05:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:56,816 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 596 transitions. [2024-11-22 02:05:56,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 02:05:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 596 transitions. [2024-11-22 02:05:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-22 02:05:56,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:05:56,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 02:05:56,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 02:05:56,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:05:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:05:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1481360023, now seen corresponding path program 1 times [2024-11-22 02:05:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:05:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063193801] [2024-11-22 02:05:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:05:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:05:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:05:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-22 02:05:56,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:05:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063193801] [2024-11-22 02:05:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063193801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:05:56,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:05:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:05:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690030276] [2024-11-22 02:05:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:05:56,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:05:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:05:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:05:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:05:56,910 INFO L87 Difference]: Start difference. First operand 488 states and 596 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 02:05:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:05:56,937 INFO L93 Difference]: Finished difference Result 691 states and 836 transitions. [2024-11-22 02:05:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:05:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 113 [2024-11-22 02:05:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:05:56,940 INFO L225 Difference]: With dead ends: 691 [2024-11-22 02:05:56,940 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 02:05:56,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:05:56,941 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:05:56,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:05:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 02:05:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 02:05:56,942 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-22 02:05:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 02:05:56,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-11-22 02:05:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:05:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 02:05:56,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 02:05:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 02:05:56,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 02:05:56,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:05:56,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 02:05:56,947 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:05:56,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 02:05:58,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:05:58,456 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (or (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (<= 2 ~waterLevel~0)) (< |old(~waterLevel~0)| 2)) (or (not (= |old(~waterLevel~0)| 1)) (and (= ~pumpRunning~0 0) (= ~waterLevel~0 1))) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (and (or (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (<= 2 ~waterLevel~0)) (< |old(~waterLevel~0)| 2)) (or (not (= |old(~waterLevel~0)| 1)) (and (= ~pumpRunning~0 0) (= ~waterLevel~0 1))) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|)))))) [2024-11-22 02:05:58,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 02:05:58,465 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-11-22 02:05:58,468 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (or (not (= |old(~waterLevel~0)| 1)) (= ~waterLevel~0 1)) (or (<= 2 ~waterLevel~0) (< |old(~waterLevel~0)| 2)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and (= ~pumpRunning~0 0) .cse0 (<= 1 |old(~waterLevel~0)|))))) Eliminated clause: (exists ((|old(~waterLevel~0)| Int)) (and (or (not (= |old(~waterLevel~0)| 1)) (= ~waterLevel~0 1)) (or (< |old(~waterLevel~0)| 2) (< 1 ~waterLevel~0)) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and (= ~pumpRunning~0 0) .cse0 (<= 1 |old(~waterLevel~0)|)))))) [2024-11-22 02:05:58,469 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 02:05:58,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:05:58 BoogieIcfgContainer [2024-11-22 02:05:58,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:05:58,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:05:58,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:05:58,471 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:05:58,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:05:53" (3/4) ... [2024-11-22 02:05:58,473 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-22 02:05:58,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-22 02:05:58,480 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-22 02:05:58,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-22 02:05:58,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 02:05:58,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 02:05:58,481 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 02:05:58,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:05:58,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 02:05:58,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:05:58,589 INFO L158 Benchmark]: Toolchain (without parser) took 6639.19ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 85.9MB in the beginning and 187.9MB in the end (delta: -102.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:05:58,589 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:05:58,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.02ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 85.7MB in the beginning and 178.8MB in the end (delta: -93.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 213.9MB. Free memory was 178.8MB in the beginning and 176.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,592 INFO L158 Benchmark]: Boogie Preprocessor took 64.26ms. Allocated memory is still 213.9MB. Free memory was 176.7MB in the beginning and 174.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,592 INFO L158 Benchmark]: RCFGBuilder took 528.52ms. Allocated memory is still 213.9MB. Free memory was 174.6MB in the beginning and 155.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,592 INFO L158 Benchmark]: TraceAbstraction took 5405.85ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 154.7MB in the beginning and 195.2MB in the end (delta: -40.6MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,592 INFO L158 Benchmark]: Witness Printer took 117.95ms. Allocated memory is still 257.9MB. Free memory was 195.2MB in the beginning and 187.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 02:05:58,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 109.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.02ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 85.7MB in the beginning and 178.8MB in the end (delta: -93.1MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 213.9MB. Free memory was 178.8MB in the beginning and 176.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.26ms. Allocated memory is still 213.9MB. Free memory was 176.7MB in the beginning and 174.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.52ms. Allocated memory is still 213.9MB. Free memory was 174.6MB in the beginning and 155.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5405.85ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 154.7MB in the beginning and 195.2MB in the end (delta: -40.6MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. * Witness Printer took 117.95ms. Allocated memory is still 257.9MB. Free memory was 195.2MB in the beginning and 187.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [415] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] - GenericResultAtLocation [Line: 548]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [548] - GenericResultAtLocation [Line: 557]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [557] - GenericResultAtLocation [Line: 592]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] - GenericResultAtLocation [Line: 700]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [700] - GenericResultAtLocation [Line: 908]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [908] - 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: 553]: 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 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 3918 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2691 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 550 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1227 mSDtfsCounter, 550 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 170 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 2 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 233/251 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: 457]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 918]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 731]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 624]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 707]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((\old(waterLevel) != 1) || (waterLevel == 1)) && (((2 <= waterLevel) && (1 == systemActive)) || ((pumpRunning == 0) && (1 <= waterLevel)))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) < 2)) || ((2 <= waterLevel) && (1 == systemActive)))) && (((1 == systemActive) && (2 <= \old(waterLevel))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))))) && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 447]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 739]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: (((((1 == systemActive) && (\old(pumpRunning) == 0)) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 612]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: (((2 <= waterLevel) && (((1 == systemActive) && (2 <= \old(waterLevel))) || (((pumpRunning == 0) && (1 == systemActive)) && (1 <= \old(waterLevel))))) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 02:05:58,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE