./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_spec5_product46.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 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:16:49,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:16:49,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:16:49,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:16:49,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:16:49,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:16:49,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:16:49,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:16:49,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:16:49,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:16:49,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:16:49,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:16:49,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:16:49,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:16:49,686 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:16:49,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:16:49,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:16:49,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:16:49,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:16:49,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:16:49,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:16:49,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:16:49,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:16:49,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:16:49,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:16:49,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:16:49,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:16:49,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:16:49,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:16:49,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:16:49,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:16:49,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:16:49,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:49,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:16:49,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:16:49,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:16:49,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:16:49,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:16:49,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:16:49,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:16:49,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:16:49,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:16:49,695 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 -> 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 [2024-11-08 15:16:49,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:16:49,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:16:49,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:16:49,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:16:49,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:16:49,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2024-11-08 15:16:51,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:16:51,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:16:51,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2024-11-08 15:16:51,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b449a1b9d/33f0018e964c43039c48f2b3f599eb46/FLAGf31ad81bc [2024-11-08 15:16:51,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b449a1b9d/33f0018e964c43039c48f2b3f599eb46 [2024-11-08 15:16:51,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:16:51,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:16:51,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:51,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:16:51,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:16:51,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:51" (1/1) ... [2024-11-08 15:16:51,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21859fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:51, skipping insertion in model container [2024-11-08 15:16:51,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:51" (1/1) ... [2024-11-08 15:16:51,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:16:52,227 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_spec5_product46.cil.c[15211,15224] [2024-11-08 15:16:52,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:52,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:16:52,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] [2024-11-08 15:16:52,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] [2024-11-08 15:16:52,270 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] [2024-11-08 15:16:52,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] [2024-11-08 15:16:52,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] [2024-11-08 15:16:52,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] [2024-11-08 15:16:52,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] [2024-11-08 15:16:52,273 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] [2024-11-08 15:16:52,327 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_spec5_product46.cil.c[15211,15224] [2024-11-08 15:16:52,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:52,374 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:16:52,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52 WrapperNode [2024-11-08 15:16:52,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:52,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:52,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:16:52,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:16:52,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,429 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 214 [2024-11-08 15:16:52,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:52,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:16:52,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:16:52,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:16:52,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,452 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-08 15:16:52,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:16:52,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:16:52,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:16:52,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:16:52,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (1/1) ... [2024-11-08 15:16:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:52,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:52,499 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-08 15:16:52,501 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-08 15:16:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:16:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:16:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:16:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:16:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:16:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:16:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:16:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:16:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:16:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:16:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:16:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-08 15:16:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-08 15:16:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-08 15:16:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-08 15:16:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:16:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:16:52,536 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:16:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:16:52,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:16:52,595 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:16:52,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:16:52,778 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-08 15:16:52,779 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:16:52,793 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:16:52,793 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:16:52,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:52 BoogieIcfgContainer [2024-11-08 15:16:52,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:16:52,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:16:52,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:16:52,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:16:52,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:16:51" (1/3) ... [2024-11-08 15:16:52,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd92df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:52, skipping insertion in model container [2024-11-08 15:16:52,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:52" (2/3) ... [2024-11-08 15:16:52,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd92df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:52, skipping insertion in model container [2024-11-08 15:16:52,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:52" (3/3) ... [2024-11-08 15:16:52,800 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product46.cil.c [2024-11-08 15:16:52,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:16:52,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:16:52,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:16:52,863 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;@20db5e1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:16:52,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:16:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 83 states have internal predecessors, (102), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 15:16:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:16:52,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:52,875 INFO L215 NwaCegarLoop]: trace histogram [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-08 15:16:52,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:52,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1607314381, now seen corresponding path program 1 times [2024-11-08 15:16:52,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809304066] [2024-11-08 15:16:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:52,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 15:16:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:16:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809304066] [2024-11-08 15:16:53,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809304066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:53,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:53,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:16:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412111487] [2024-11-08 15:16:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:16:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:16:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:16:53,155 INFO L87 Difference]: Start difference. First operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 83 states have internal predecessors, (102), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:53,177 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2024-11-08 15:16:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:16:53,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-08 15:16:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:53,186 INFO L225 Difference]: With dead ends: 189 [2024-11-08 15:16:53,186 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 15:16:53,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-08 15:16:53,191 INFO L432 NwaCegarLoop]: 124 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, 124 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-08 15:16:53,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 15:16:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 15:16:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 75 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 15:16:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2024-11-08 15:16:53,225 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 32 [2024-11-08 15:16:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:53,225 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2024-11-08 15:16:53,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2024-11-08 15:16:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:16:53,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:53,227 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:16:53,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:16:53,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:53,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash -824221923, now seen corresponding path program 1 times [2024-11-08 15:16:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400967864] [2024-11-08 15:16:53,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:16:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:16:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:53,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:53,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400967864] [2024-11-08 15:16:53,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400967864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:53,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:53,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:53,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95167673] [2024-11-08 15:16:53,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:53,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:53,309 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:53,323 INFO L93 Difference]: Finished difference Result 144 states and 184 transitions. [2024-11-08 15:16:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-08 15:16:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:53,327 INFO L225 Difference]: With dead ends: 144 [2024-11-08 15:16:53,327 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 15:16:53,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 15:16:53,328 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 187 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-08 15:16:53,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 187 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 15:16:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 15:16:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 69 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:16:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-11-08 15:16:53,347 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 33 [2024-11-08 15:16:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-11-08 15:16:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-11-08 15:16:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 15:16:53,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:53,351 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:16:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:16:53,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash 534456794, now seen corresponding path program 1 times [2024-11-08 15:16:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359512348] [2024-11-08 15:16:53,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:53,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:16:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359512348] [2024-11-08 15:16:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359512348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:16:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102519964] [2024-11-08 15:16:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:16:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:16:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:53,511 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-08 15:16:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:53,573 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2024-11-08 15:16:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:16:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 38 [2024-11-08 15:16:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:53,575 INFO L225 Difference]: With dead ends: 154 [2024-11-08 15:16:53,577 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 15:16:53,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:16:53,579 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 93 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:53,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 15:16:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 15:16:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 69 states have internal predecessors, (80), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 15:16:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2024-11-08 15:16:53,594 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 38 [2024-11-08 15:16:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2024-11-08 15:16:53,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-08 15:16:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2024-11-08 15:16:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 15:16:53,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:53,599 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:16:53,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:16:53,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:53,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash -216434858, now seen corresponding path program 1 times [2024-11-08 15:16:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615553924] [2024-11-08 15:16:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:16:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:16:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615553924] [2024-11-08 15:16:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615553924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:53,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:16:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370430928] [2024-11-08 15:16:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:16:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:16:53,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:53,705 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:16:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:53,891 INFO L93 Difference]: Finished difference Result 238 states and 300 transitions. [2024-11-08 15:16:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:16:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 48 [2024-11-08 15:16:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:53,893 INFO L225 Difference]: With dead ends: 238 [2024-11-08 15:16:53,893 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 15:16:53,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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-08 15:16:53,894 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 207 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:53,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 287 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 15:16:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2024-11-08 15:16:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 130 states have internal predecessors, (153), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-08 15:16:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2024-11-08 15:16:53,914 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 194 transitions. Word has length 48 [2024-11-08 15:16:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 194 transitions. [2024-11-08 15:16:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 15:16:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2024-11-08 15:16:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 15:16:53,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:53,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:16:53,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:53,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1219044606, now seen corresponding path program 1 times [2024-11-08 15:16:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978454276] [2024-11-08 15:16:53,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:16:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:16:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:16:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978454276] [2024-11-08 15:16:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978454276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:16:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513501711] [2024-11-08 15:16:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:16:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:16:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:16:54,025 INFO L87 Difference]: Start difference. First operand 159 states and 194 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,195 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2024-11-08 15:16:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:16:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-08 15:16:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,197 INFO L225 Difference]: With dead ends: 310 [2024-11-08 15:16:54,197 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 15:16:54,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:16:54,198 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 141 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 391 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 15:16:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-08 15:16:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.225) internal successors, (147), 128 states have internal predecessors, (147), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-08 15:16:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2024-11-08 15:16:54,209 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 54 [2024-11-08 15:16:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,209 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2024-11-08 15:16:54,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2024-11-08 15:16:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:16:54,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:54,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:16:54,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 175038302, now seen corresponding path program 1 times [2024-11-08 15:16:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316039664] [2024-11-08 15:16:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:16:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:16:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:54,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316039664] [2024-11-08 15:16:54,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316039664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:16:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125187405] [2024-11-08 15:16:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:54,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:16:54,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:16:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:16:54,284 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,385 INFO L93 Difference]: Finished difference Result 311 states and 379 transitions. [2024-11-08 15:16:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:16:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-08 15:16:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,387 INFO L225 Difference]: With dead ends: 311 [2024-11-08 15:16:54,387 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 15:16:54,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:54,388 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 345 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 15:16:54,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-11-08 15:16:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 131 states have internal predecessors, (150), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-08 15:16:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 191 transitions. [2024-11-08 15:16:54,402 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 191 transitions. Word has length 60 [2024-11-08 15:16:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,402 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 191 transitions. [2024-11-08 15:16:54,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 191 transitions. [2024-11-08 15:16:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:16:54,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:54,403 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:16:54,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:54,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2098266336, now seen corresponding path program 1 times [2024-11-08 15:16:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928809609] [2024-11-08 15:16:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:16:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:16:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928809609] [2024-11-08 15:16:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928809609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:54,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:16:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531625106] [2024-11-08 15:16:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:16:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:16:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:16:54,497 INFO L87 Difference]: Start difference. First operand 160 states and 191 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,624 INFO L93 Difference]: Finished difference Result 316 states and 384 transitions. [2024-11-08 15:16:54,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:16:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-08 15:16:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,626 INFO L225 Difference]: With dead ends: 316 [2024-11-08 15:16:54,627 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 15:16:54,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:54,628 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 56 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 413 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 15:16:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-08 15:16:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 125 states have (on average 1.216) internal successors, (152), 133 states have internal predecessors, (152), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-08 15:16:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2024-11-08 15:16:54,663 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 60 [2024-11-08 15:16:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,663 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2024-11-08 15:16:54,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:16:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2024-11-08 15:16:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:16:54,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:54,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:16:54,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:54,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -810497566, now seen corresponding path program 1 times [2024-11-08 15:16:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090027810] [2024-11-08 15:16:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 15:16:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:16:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:54,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090027810] [2024-11-08 15:16:54,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090027810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:54,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:54,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:16:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070055677] [2024-11-08 15:16:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:54,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:16:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:54,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:16:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:54,752 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:16:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,907 INFO L93 Difference]: Finished difference Result 448 states and 559 transitions. [2024-11-08 15:16:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:16:54,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2024-11-08 15:16:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,909 INFO L225 Difference]: With dead ends: 448 [2024-11-08 15:16:54,909 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 15:16:54,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-08 15:16:54,910 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 218 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 285 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 15:16:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2024-11-08 15:16:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 223 states have (on average 1.201793721973094) internal successors, (268), 235 states have internal predecessors, (268), 36 states have call successors, (36), 31 states have call predecessors, (36), 32 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51) [2024-11-08 15:16:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2024-11-08 15:16:54,927 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 60 [2024-11-08 15:16:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2024-11-08 15:16:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:16:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2024-11-08 15:16:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:16:54,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:54,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:16:54,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:54,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1779897540, now seen corresponding path program 1 times [2024-11-08 15:16:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604270661] [2024-11-08 15:16:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:16:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:16:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 15:16:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604270661] [2024-11-08 15:16:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604270661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:16:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001582422] [2024-11-08 15:16:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:55,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:16:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:16:55,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:16:55,050 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 15:16:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:55,479 INFO L93 Difference]: Finished difference Result 831 states and 1040 transitions. [2024-11-08 15:16:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:16:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 64 [2024-11-08 15:16:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:55,482 INFO L225 Difference]: With dead ends: 831 [2024-11-08 15:16:55,482 INFO L226 Difference]: Without dead ends: 598 [2024-11-08 15:16:55,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-08 15:16:55,483 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 416 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:55,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 582 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:16:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-11-08 15:16:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 542. [2024-11-08 15:16:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 414 states have (on average 1.1956521739130435) internal successors, (495), 438 states have internal predecessors, (495), 66 states have call successors, (66), 55 states have call predecessors, (66), 61 states have return successors, (90), 66 states have call predecessors, (90), 66 states have call successors, (90) [2024-11-08 15:16:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 651 transitions. [2024-11-08 15:16:55,513 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 651 transitions. Word has length 64 [2024-11-08 15:16:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:55,513 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 651 transitions. [2024-11-08 15:16:55,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 15:16:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 651 transitions. [2024-11-08 15:16:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 15:16:55,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:55,515 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:16:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:16:55,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:55,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:55,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2079059227, now seen corresponding path program 1 times [2024-11-08 15:16:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:55,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383714840] [2024-11-08 15:16:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:16:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:16:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:16:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:16:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:16:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:16:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:16:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383714840] [2024-11-08 15:16:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383714840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340555533] [2024-11-08 15:16:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:55,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:55,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:55,687 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-08 15:16:55,689 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-08 15:16:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:55,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:16:55,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:16:55,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:16:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340555533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:56,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2024-11-08 15:16:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034565138] [2024-11-08 15:16:56,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:56,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 15:16:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 15:16:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:16:56,187 INFO L87 Difference]: Start difference. First operand 542 states and 651 transitions. Second operand has 16 states, 16 states have (on average 7.875) internal successors, (126), 11 states have internal predecessors, (126), 5 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 15:16:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:57,433 INFO L93 Difference]: Finished difference Result 1191 states and 1465 transitions. [2024-11-08 15:16:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 15:16:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 11 states have internal predecessors, (126), 5 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) Word has length 108 [2024-11-08 15:16:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:57,437 INFO L225 Difference]: With dead ends: 1191 [2024-11-08 15:16:57,437 INFO L226 Difference]: Without dead ends: 706 [2024-11-08 15:16:57,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 238 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=1389, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 15:16:57,439 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 359 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:57,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1659 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:16:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-08 15:16:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 614. [2024-11-08 15:16:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 464 states have (on average 1.1939655172413792) internal successors, (554), 496 states have internal predecessors, (554), 77 states have call successors, (77), 66 states have call predecessors, (77), 72 states have return successors, (101), 74 states have call predecessors, (101), 77 states have call successors, (101) [2024-11-08 15:16:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 732 transitions. [2024-11-08 15:16:57,493 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 732 transitions. Word has length 108 [2024-11-08 15:16:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 732 transitions. [2024-11-08 15:16:57,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.875) internal successors, (126), 11 states have internal predecessors, (126), 5 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 15:16:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 732 transitions. [2024-11-08 15:16:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 15:16:57,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:57,495 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 15:16:57,512 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-08 15:16:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:16:57,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2082434884, now seen corresponding path program 1 times [2024-11-08 15:16:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146025122] [2024-11-08 15:16:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:16:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:16:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:16:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:16:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:16:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-08 15:16:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:16:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:16:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 15:16:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-08 15:16:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146025122] [2024-11-08 15:16:58,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146025122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:58,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231822801] [2024-11-08 15:16:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:58,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:58,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:58,018 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:16:58,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:16:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:58,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 15:16:58,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 158 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 15:16:58,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 81 proven. 39 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-08 15:16:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231822801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:58,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 28 [2024-11-08 15:16:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533810065] [2024-11-08 15:16:58,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 15:16:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 15:16:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:16:58,854 INFO L87 Difference]: Start difference. First operand 614 states and 732 transitions. Second operand has 28 states, 28 states have (on average 7.857142857142857) internal successors, (220), 22 states have internal predecessors, (220), 9 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (37), 10 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-08 15:17:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:00,725 INFO L93 Difference]: Finished difference Result 1816 states and 2282 transitions. [2024-11-08 15:17:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-08 15:17:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.857142857142857) internal successors, (220), 22 states have internal predecessors, (220), 9 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (37), 10 states have call predecessors, (37), 9 states have call successors, (37) Word has length 192 [2024-11-08 15:17:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:00,730 INFO L225 Difference]: With dead ends: 1816 [2024-11-08 15:17:00,730 INFO L226 Difference]: Without dead ends: 1210 [2024-11-08 15:17:00,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=968, Invalid=4582, Unknown=0, NotChecked=0, Total=5550 [2024-11-08 15:17:00,733 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1580 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:00,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 1227 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 15:17:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-08 15:17:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1092. [2024-11-08 15:17:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 828 states have (on average 1.1352657004830917) internal successors, (940), 869 states have internal predecessors, (940), 141 states have call successors, (141), 123 states have call predecessors, (141), 122 states have return successors, (159), 129 states have call predecessors, (159), 141 states have call successors, (159) [2024-11-08 15:17:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1240 transitions. [2024-11-08 15:17:00,841 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1240 transitions. Word has length 192 [2024-11-08 15:17:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1240 transitions. [2024-11-08 15:17:00,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.857142857142857) internal successors, (220), 22 states have internal predecessors, (220), 9 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (37), 10 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-08 15:17:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1240 transitions. [2024-11-08 15:17:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 15:17:00,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:00,844 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 15:17:00,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:17:01,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:17:01,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1341529588, now seen corresponding path program 1 times [2024-11-08 15:17:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467456630] [2024-11-08 15:17:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:17:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:17:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:17:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 15:17:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:17:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:17:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 15:17:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 15:17:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 15:17:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:17:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 101 proven. 29 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-08 15:17:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467456630] [2024-11-08 15:17:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467456630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:01,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096456823] [2024-11-08 15:17:01,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:01,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:01,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:01,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:17:01,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:17:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:01,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:17:01,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 15:17:01,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:17:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096456823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:17:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2024-11-08 15:17:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618417916] [2024-11-08 15:17:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:17:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:17:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:17:01,507 INFO L87 Difference]: Start difference. First operand 1092 states and 1240 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:17:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:01,735 INFO L93 Difference]: Finished difference Result 1988 states and 2267 transitions. [2024-11-08 15:17:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:17:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 216 [2024-11-08 15:17:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:01,753 INFO L225 Difference]: With dead ends: 1988 [2024-11-08 15:17:01,753 INFO L226 Difference]: Without dead ends: 1002 [2024-11-08 15:17:01,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:17:01,759 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 55 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:01,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 759 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2024-11-08 15:17:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2024-11-08 15:17:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 765 states have (on average 1.1320261437908496) internal successors, (866), 798 states have internal predecessors, (866), 128 states have call successors, (128), 112 states have call predecessors, (128), 108 states have return successors, (142), 114 states have call predecessors, (142), 128 states have call successors, (142) [2024-11-08 15:17:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1136 transitions. [2024-11-08 15:17:01,875 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1136 transitions. Word has length 216 [2024-11-08 15:17:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1136 transitions. [2024-11-08 15:17:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 6 states have internal predecessors, (130), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:17:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1136 transitions. [2024-11-08 15:17:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 15:17:01,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:01,883 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 15:17:01,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:17:02,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:02,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:02,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:02,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1263314444, now seen corresponding path program 2 times [2024-11-08 15:17:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377418485] [2024-11-08 15:17:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:17:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:17:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:17:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 15:17:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:17:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:17:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 15:17:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 15:17:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 15:17:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:17:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 100 proven. 44 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 15:17:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377418485] [2024-11-08 15:17:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377418485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028991405] [2024-11-08 15:17:02,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:17:02,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:02,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:17:02,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:17:02,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:17:02,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:17:02,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:17:02,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 200 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-08 15:17:02,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 104 proven. 54 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 15:17:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028991405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:03,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 23 [2024-11-08 15:17:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366968367] [2024-11-08 15:17:03,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:03,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:17:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:17:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:17:03,164 INFO L87 Difference]: Start difference. First operand 1002 states and 1136 transitions. Second operand has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 16 states have internal predecessors, (218), 6 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-08 15:17:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:04,342 INFO L93 Difference]: Finished difference Result 1950 states and 2231 transitions. [2024-11-08 15:17:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 15:17:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 16 states have internal predecessors, (218), 6 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 6 states have call successors, (39) Word has length 216 [2024-11-08 15:17:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:04,351 INFO L225 Difference]: With dead ends: 1950 [2024-11-08 15:17:04,351 INFO L226 Difference]: Without dead ends: 1054 [2024-11-08 15:17:04,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 473 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1866, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 15:17:04,355 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 495 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:04,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 519 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:17:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-11-08 15:17:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 998. [2024-11-08 15:17:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 763 states have (on average 1.1218872870249017) internal successors, (856), 794 states have internal predecessors, (856), 122 states have call successors, (122), 114 states have call predecessors, (122), 112 states have return successors, (136), 112 states have call predecessors, (136), 122 states have call successors, (136) [2024-11-08 15:17:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1114 transitions. [2024-11-08 15:17:04,444 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1114 transitions. Word has length 216 [2024-11-08 15:17:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:04,445 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1114 transitions. [2024-11-08 15:17:04,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.478260869565217) internal successors, (218), 16 states have internal predecessors, (218), 6 states have call successors, (45), 8 states have call predecessors, (45), 11 states have return successors, (39), 9 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-08 15:17:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1114 transitions. [2024-11-08 15:17:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 15:17:04,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:04,449 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 15:17:04,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:17:04,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:04,650 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:04,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:04,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196638, now seen corresponding path program 1 times [2024-11-08 15:17:04,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:04,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561974253] [2024-11-08 15:17:04,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:17:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 15:17:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:17:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:17:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:17:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:17:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 15:17:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 15:17:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:17:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:17:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:17:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 15:17:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 15:17:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 15:17:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-08 15:17:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:17:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-08 15:17:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 116 proven. 43 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 15:17:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561974253] [2024-11-08 15:17:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561974253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601192608] [2024-11-08 15:17:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:05,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:05,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:17:05,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:17:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:05,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:17:05,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 142 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-08 15:17:05,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 103 proven. 45 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 15:17:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601192608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:06,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 13] total 25 [2024-11-08 15:17:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049274115] [2024-11-08 15:17:06,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:17:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:06,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:17:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:17:06,144 INFO L87 Difference]: Start difference. First operand 998 states and 1114 transitions. Second operand has 25 states, 25 states have (on average 10.16) internal successors, (254), 21 states have internal predecessors, (254), 16 states have call successors, (48), 11 states have call predecessors, (48), 14 states have return successors, (45), 16 states have call predecessors, (45), 16 states have call successors, (45) [2024-11-08 15:17:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:07,385 INFO L93 Difference]: Finished difference Result 1905 states and 2175 transitions. [2024-11-08 15:17:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 15:17:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 21 states have internal predecessors, (254), 16 states have call successors, (48), 11 states have call predecessors, (48), 14 states have return successors, (45), 16 states have call predecessors, (45), 16 states have call successors, (45) Word has length 217 [2024-11-08 15:17:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:07,388 INFO L225 Difference]: With dead ends: 1905 [2024-11-08 15:17:07,388 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:17:07,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 473 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=902, Invalid=3004, Unknown=0, NotChecked=0, Total=3906 [2024-11-08 15:17:07,395 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 720 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:07,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 562 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 15:17:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:17:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:17:07,397 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-08 15:17:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:17:07,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2024-11-08 15:17:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:17:07,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.16) internal successors, (254), 21 states have internal predecessors, (254), 16 states have call successors, (48), 11 states have call predecessors, (48), 14 states have return successors, (45), 16 states have call predecessors, (45), 16 states have call successors, (45) [2024-11-08 15:17:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:17:07,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:17:07,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:17:07,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:17:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 15:17:07,609 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:07,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:17:18,352 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:17:18,391 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (let ((.cse4 (<= 1 ~pumpRunning~0)) (.cse1 (= |old(~methaneLevelCritical~0)| 0)) (.cse0 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse3) (and .cse4 (= 2 ~waterLevel~0) .cse1 .cse3) (and .cse0 (<= 1 |old(~methaneLevelCritical~0)|) .cse2 .cse3))) (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (not (= 0 ~systemActive~0)))) (or (and .cse0 (<= 1 ~methaneLevelCritical~0) .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and .cse4 .cse3 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse2) (and .cse4 (= 2 ~waterLevel~0) .cse3 .cse2))) [2024-11-08 15:17:18,399 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (let ((.cse1 (= |old(~pumpRunning~0)| 0)) (.cse6 (= |old(~waterLevel~0)| 2)) (.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse7 (<= 1 |old(~switchedOnBeforeTS~0)|)) (.cse2 (<= |old(~waterLevel~0)| 2)) (.cse5 (<= 1 |old(~pumpRunning~0)|)) (.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse4 .cse7 .cse2 .cse5 .cse3) (and .cse0 .cse7 .cse2 .cse5 .cse3))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse3 (<= 1 ~switchedOnBeforeTS~0)) (.cse6 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse7 (= 2 ~waterLevel~0)) (.cse4 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse6 .cse1 .cse2 .cse4) (and .cse6 .cse5 .cse2 .cse4) (and .cse0 .cse7 .cse5 .cse4) (and .cse0 .cse1 .cse7 .cse4))) [2024-11-08 15:17:18,413 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse5 (= |old(~waterLevel~0)| 2)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse2 (<= |old(~waterLevel~0)| 1)) (.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse6 .cse4 .cse3 .cse5) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse5) (and .cse6 .cse4 .cse2 (<= 1 ~switchedOnBeforeTS~0) .cse3)))) Eliminated clause: (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse1 (= 2 ~waterLevel~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse2 (= ~methaneLevelCritical~0 0)) (.cse5 (<= ~waterLevel~0 1)) (.cse3 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse0 .cse4 .cse1 .cse3) (and .cse6 .cse2 .cse5 (<= 1 ~switchedOnBeforeTS~0) .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse5 .cse3))) [2024-11-08 15:17:18,431 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse2 (= ~methaneLevelCritical~0 0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0 (<= ~waterLevel~0 2) .cse1) (and (= 2 ~waterLevel~0) .cse2 .cse0 .cse1) (and .cse2 .cse0 (<= ~waterLevel~0 0) .cse1) (and .cse2 .cse0 (= ~waterLevel~0 1) .cse1) (and .cse2 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse1))) (or (= ~pumpRunning~0 0) (< 0 |old(~pumpRunning~0)|))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (< 0 ~pumpRunning~0) .cse0) (let ((.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1 .cse2) (and .cse0 (<= 1 ~methaneLevelCritical~0) (<= ~waterLevel~0 2) .cse2) (and .cse0 .cse1 (= ~waterLevel~0 1) .cse2) (and .cse0 .cse1 (<= ~waterLevel~0 0) .cse2) (and .cse1 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse2))))) [2024-11-08 15:17:18,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:17:18 BoogieIcfgContainer [2024-11-08 15:17:18,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:17:18,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:17:18,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:17:18,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:17:18,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:52" (3/4) ... [2024-11-08 15:17:18,473 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:17:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-11-08 15:17:18,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-08 15:17:18,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-11-08 15:17:18,484 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-08 15:17:18,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:17:18,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:17:18,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:18,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:17:18,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:17:18,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:17:18,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:17:18,593 INFO L158 Benchmark]: Toolchain (without parser) took 26682.49ms. Allocated memory was 142.6MB in the beginning and 450.9MB in the end (delta: 308.3MB). Free memory was 86.3MB in the beginning and 264.9MB in the end (delta: -178.6MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,593 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:17:18,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.04ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 86.0MB in the beginning and 186.4MB in the end (delta: -100.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 183.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,593 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 216.0MB. Free memory was 183.3MB in the beginning and 181.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,594 INFO L158 Benchmark]: RCFGBuilder took 326.43ms. Allocated memory is still 216.0MB. Free memory was 181.2MB in the beginning and 162.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,594 INFO L158 Benchmark]: TraceAbstraction took 25669.76ms. Allocated memory was 216.0MB in the beginning and 450.9MB in the end (delta: 234.9MB). Free memory was 161.2MB in the beginning and 274.3MB in the end (delta: -113.1MB). Peak memory consumption was 255.0MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,594 INFO L158 Benchmark]: Witness Printer took 126.34ms. Allocated memory is still 450.9MB. Free memory was 273.3MB in the beginning and 264.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:17:18,598 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.15ms. Allocated memory is still 142.6MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.04ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 86.0MB in the beginning and 186.4MB in the end (delta: -100.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 216.0MB. Free memory was 186.4MB in the beginning and 183.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 216.0MB. Free memory was 183.3MB in the beginning and 181.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.43ms. Allocated memory is still 216.0MB. Free memory was 181.2MB in the beginning and 162.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25669.76ms. Allocated memory was 216.0MB in the beginning and 450.9MB in the end (delta: 234.9MB). Free memory was 161.2MB in the beginning and 274.3MB in the end (delta: -113.1MB). Peak memory consumption was 255.0MB. Max. memory is 16.1GB. * Witness Printer took 126.34ms. Allocated memory is still 450.9MB. Free memory was 273.3MB in the beginning and 264.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] - GenericResultAtLocation [Line: 101]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] - GenericResultAtLocation [Line: 206]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] - GenericResultAtLocation [Line: 572]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] - GenericResultAtLocation [Line: 670]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] - GenericResultAtLocation [Line: 705]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] - GenericResultAtLocation [Line: 714]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] - GenericResultAtLocation [Line: 923]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] * 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: 710]: 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 9 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4465 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4410 mSDsluCounter, 7635 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6158 mSDsCounter, 1513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8149 IncrementalHoareTripleChecker+Invalid, 9662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1513 mSolverCounterUnsat, 1477 mSDtfsCounter, 8149 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2253 GetRequests, 1941 SyntacticMatches, 15 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3140 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1092occurred in iteration=11, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 336 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2347 NumberOfCodeBlocks, 2347 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3057 ConstructedInterpolants, 0 QuantifiedInterpolants, 6280 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2757 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 23 InterpolantComputations, 10 PerfectInterpolantSequences, 2620/2942 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: 933]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (waterLevel == 1)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (waterLevel <= 0)) && (0 != systemActive))) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (splverifierCounter == 0)) && (0 != systemActive))) || ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) - ProcedureContractResult [Line: 748]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (0 != systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (0 != systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 603]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (0 != systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) Ensures: ((((((((((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (waterLevel <= 2)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (\old(methaneLevelCritical) == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (\old(methaneLevelCritical) == 0)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (waterLevel <= 2)) && (0 != systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 721]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) Ensures: (((((((((((0 < \old(waterLevel)) || (\old(waterLevel) == waterLevel)) && (((pumpRunning == \old(pumpRunning)) || (methaneLevelCritical != 0)) || (\old(pumpRunning) < 1))) && ((((waterLevel == 1) && (1 <= switchedOnBeforeTS)) || (\old(waterLevel) != 2)) || (\old(pumpRunning) < 1))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) < 1)) || ((waterLevel <= 0) && (1 <= switchedOnBeforeTS)))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && ((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2)) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2))) || ((((methaneLevelCritical == 0) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning)))) || (((1 <= methaneLevelCritical) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2))) || (((methaneLevelCritical == 0) && (1 <= \old(pumpRunning))) && (\old(waterLevel) == 2))) || ((((1 <= methaneLevelCritical) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning))))) && (0 != systemActive)) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 104]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 591]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 1)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (0 != systemActive))) Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (2 == waterLevel))) && (((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (\old(waterLevel) <= 1)) && (0 != systemActive)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 != systemActive)) && (\old(waterLevel) == 2))) || ((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (0 != systemActive)) && (\old(waterLevel) == 2))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (\old(waterLevel) <= 1)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 != systemActive)) && (\old(waterLevel) == 2))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 756]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: (((0 < pumpRunning) || (pumpRunning == 0)) && ((((((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel == 1)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 0)) && (0 != systemActive))) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) Ensures: (((((((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && ((0 < pumpRunning) || (pumpRunning == 0))) && ((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (waterLevel <= 2)) && (0 != systemActive)) || ((((2 == waterLevel) && (methaneLevelCritical == 0)) && (\old(pumpRunning) == 0)) && (0 != systemActive))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (waterLevel <= 0))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (waterLevel == 1))) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((1 < waterLevel) || (((pumpRunning == 0) && (\old(pumpRunning) == 0)) && (0 != systemActive))) || (0 < \old(pumpRunning)))) && ((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 851]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 1)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) Ensures: (((pumpRunning == \result) && (((((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (waterLevel <= 1)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 2)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive)))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 840]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((((((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: (((methaneLevelCritical == \result) && ((((((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (0 != systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (2 == waterLevel)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((((((switchedOnBeforeTS == \old(switchedOnBeforeTS)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:17:18,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE