./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_product35.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 45ba8c3ee5105630bc9146965d68439e6204903aca4c5a31cd4f017e456c8589 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:55:52,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:55:52,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:55:52,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:55:52,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:55:52,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:55:52,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:55:52,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:55:52,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:55:52,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:55:52,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:55:52,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:55:52,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:55:52,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:55:52,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:55:52,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:55:52,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:55:52,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:55:52,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:55:52,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:55:52,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:55:52,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:55:52,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:55:52,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:55:52,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:55:52,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:55:52,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:55:52,563 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:55:52,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:55:52,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:55:52,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:55:52,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:55:52,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:52,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:55:52,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:55:52,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:55:52,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:55:52,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:55:52,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:55:52,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:55:52,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:55:52,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:55:52,566 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 -> 45ba8c3ee5105630bc9146965d68439e6204903aca4c5a31cd4f017e456c8589 [2024-11-11 20:55:52,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:55:52,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:55:52,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:55:52,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:55:52,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:55:52,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product35.cil.c [2024-11-11 20:55:54,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:55:54,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:55:54,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product35.cil.c [2024-11-11 20:55:54,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a11ced8/32d71f0eaac3447dbc150bc2063feed1/FLAG2c83e80c2 [2024-11-11 20:55:54,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a11ced8/32d71f0eaac3447dbc150bc2063feed1 [2024-11-11 20:55:54,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:55:54,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:55:54,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:54,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:55:54,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:55:54,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:54" (1/1) ... [2024-11-11 20:55:54,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef56591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:54, skipping insertion in model container [2024-11-11 20:55:54,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:54" (1/1) ... [2024-11-11 20:55:54,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:55:55,088 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_product35.cil.c[1605,1618] [2024-11-11 20:55:55,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:55,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:55:55,278 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-11 20:55:55,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] [2024-11-11 20:55:55,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [164] [2024-11-11 20:55:55,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [530] [2024-11-11 20:55:55,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [565] [2024-11-11 20:55:55,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [633] [2024-11-11 20:55:55,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [732] [2024-11-11 20:55:55,281 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [907] [2024-11-11 20:55:55,285 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_product35.cil.c[1605,1618] [2024-11-11 20:55:55,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:55,359 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:55:55,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55 WrapperNode [2024-11-11 20:55:55,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:55,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:55,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:55:55,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:55:55,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,407 INFO L138 Inliner]: procedures = 55, calls = 98, calls flagged for inlining = 24, calls inlined = 20, statements flattened = 182 [2024-11-11 20:55:55,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:55,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:55:55,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:55:55,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:55:55,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,435 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-11 20:55:55,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:55:55,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:55:55,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:55:55,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:55:55,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (1/1) ... [2024-11-11 20:55:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:55,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:55,479 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-11 20:55:55,482 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-11 20:55:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:55:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:55:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:55:55,523 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:55:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:55:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:55:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:55:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:55:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:55:55,524 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-11 20:55:55,525 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-11 20:55:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:55:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:55:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:55:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:55:55,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:55:55,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:55:55,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:55:55,837 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-11 20:55:55,837 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:55:55,856 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:55:55,856 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:55:55,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:55 BoogieIcfgContainer [2024-11-11 20:55:55,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:55:55,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:55:55,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:55:55,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:55:55,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:55:54" (1/3) ... [2024-11-11 20:55:55,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa12914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:55, skipping insertion in model container [2024-11-11 20:55:55,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:55" (2/3) ... [2024-11-11 20:55:55,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa12914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:55, skipping insertion in model container [2024-11-11 20:55:55,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:55" (3/3) ... [2024-11-11 20:55:55,867 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product35.cil.c [2024-11-11 20:55:55,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:55:55,882 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:55:55,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:55:55,942 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;@1dff00a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:55:55,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:55:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 66 states have (on average 1.378787878787879) internal successors, (91), 72 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 20:55:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 20:55:55,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:55,953 INFO L218 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-11 20:55:55,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:55,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash -569276447, now seen corresponding path program 1 times [2024-11-11 20:55:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721371990] [2024-11-11 20:55:55,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:55:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:55:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,134 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-11 20:55:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721371990] [2024-11-11 20:55:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721371990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963173081] [2024-11-11 20:55:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:55:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:55:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:56,165 INFO L87 Difference]: Start difference. First operand has 84 states, 66 states have (on average 1.378787878787879) internal successors, (91), 72 states have internal predecessors, (91), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) 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-11 20:55:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:56,203 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2024-11-11 20:55:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:55:56,205 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-11 20:55:56,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:56,222 INFO L225 Difference]: With dead ends: 159 [2024-11-11 20:55:56,225 INFO L226 Difference]: Without dead ends: 75 [2024-11-11 20:55:56,242 INFO L434 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-11 20:55:56,248 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:56,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-11 20:55:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-11 20:55:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.305084745762712) internal successors, (77), 64 states have internal predecessors, (77), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:55:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-11 20:55:56,286 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 32 [2024-11-11 20:55:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:56,287 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-11 20:55:56,287 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-11 20:55:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-11 20:55:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 20:55:56,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:56,290 INFO L218 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] [2024-11-11 20:55:56,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:55:56,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:56,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2081952552, now seen corresponding path program 1 times [2024-11-11 20:55:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561584591] [2024-11-11 20:55:56,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:55:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,510 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-11 20:55:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561584591] [2024-11-11 20:55:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561584591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:56,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499971995] [2024-11-11 20:55:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:56,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:56,514 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11 20:55:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:56,723 INFO L93 Difference]: Finished difference Result 261 states and 349 transitions. [2024-11-11 20:55:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:55:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 37 [2024-11-11 20:55:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:56,727 INFO L225 Difference]: With dead ends: 261 [2024-11-11 20:55:56,728 INFO L226 Difference]: Without dead ends: 194 [2024-11-11 20:55:56,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:56,732 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 211 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:56,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 389 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-11 20:55:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2024-11-11 20:55:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.326241134751773) internal successors, (187), 152 states have internal predecessors, (187), 28 states have call successors, (28), 17 states have call predecessors, (28), 14 states have return successors, (28), 23 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-11 20:55:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2024-11-11 20:55:56,771 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 37 [2024-11-11 20:55:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:56,772 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2024-11-11 20:55:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11 20:55:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2024-11-11 20:55:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 20:55:56,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:56,775 INFO L218 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] [2024-11-11 20:55:56,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:55:56,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -2078291855, now seen corresponding path program 1 times [2024-11-11 20:55:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114576539] [2024-11-11 20:55:56,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:55:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:55:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:56,929 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-11 20:55:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:56,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114576539] [2024-11-11 20:55:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114576539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:56,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:56,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813328269] [2024-11-11 20:55:56,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:56,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:56,933 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:56,987 INFO L93 Difference]: Finished difference Result 461 states and 639 transitions. [2024-11-11 20:55:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-11 20:55:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:56,994 INFO L225 Difference]: With dead ends: 461 [2024-11-11 20:55:56,996 INFO L226 Difference]: Without dead ends: 285 [2024-11-11 20:55:57,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-11 20:55:57,001 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:57,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 177 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-11 20:55:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2024-11-11 20:55:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 227 states have internal predecessors, (278), 44 states have call successors, (44), 29 states have call predecessors, (44), 24 states have return successors, (57), 39 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-11 20:55:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 379 transitions. [2024-11-11 20:55:57,068 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 379 transitions. Word has length 42 [2024-11-11 20:55:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:57,070 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 379 transitions. [2024-11-11 20:55:57,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 379 transitions. [2024-11-11 20:55:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 20:55:57,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:57,075 INFO L218 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] [2024-11-11 20:55:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:55:57,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:57,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1830972643, now seen corresponding path program 1 times [2024-11-11 20:55:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222943150] [2024-11-11 20:55:57,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:55:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:55:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,253 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-11 20:55:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222943150] [2024-11-11 20:55:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222943150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783709059] [2024-11-11 20:55:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:57,258 INFO L87 Difference]: Start difference. First operand 283 states and 379 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:57,393 INFO L93 Difference]: Finished difference Result 555 states and 762 transitions. [2024-11-11 20:55:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:55:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-11 20:55:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:57,406 INFO L225 Difference]: With dead ends: 555 [2024-11-11 20:55:57,407 INFO L226 Difference]: Without dead ends: 280 [2024-11-11 20:55:57,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-11 20:55:57,409 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:57,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 446 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:55:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-11 20:55:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-11 20:55:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 224 states have internal predecessors, (269), 44 states have call successors, (44), 29 states have call predecessors, (44), 24 states have return successors, (57), 39 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-11 20:55:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 370 transitions. [2024-11-11 20:55:57,450 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 370 transitions. Word has length 41 [2024-11-11 20:55:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:57,451 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 370 transitions. [2024-11-11 20:55:57,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:55:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 370 transitions. [2024-11-11 20:55:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:57,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:57,455 INFO L218 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] [2024-11-11 20:55:57,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:55:57,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1378984981, now seen corresponding path program 1 times [2024-11-11 20:55:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:57,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464728551] [2024-11-11 20:55:57,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:55:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,528 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-11 20:55:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464728551] [2024-11-11 20:55:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464728551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:57,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:55:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769320871] [2024-11-11 20:55:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:55:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:57,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:55:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:55:57,534 INFO L87 Difference]: Start difference. First operand 280 states and 370 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 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-11 20:55:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:57,576 INFO L93 Difference]: Finished difference Result 558 states and 755 transitions. [2024-11-11 20:55:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:55:57,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 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 46 [2024-11-11 20:55:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:57,581 INFO L225 Difference]: With dead ends: 558 [2024-11-11 20:55:57,583 INFO L226 Difference]: Without dead ends: 286 [2024-11-11 20:55:57,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:55:57,589 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:57,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-11 20:55:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-11 20:55:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 217 states have (on average 1.2672811059907834) internal successors, (275), 230 states have internal predecessors, (275), 44 states have call successors, (44), 29 states have call predecessors, (44), 24 states have return successors, (57), 39 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-11 20:55:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 376 transitions. [2024-11-11 20:55:57,622 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 376 transitions. Word has length 46 [2024-11-11 20:55:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:57,623 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 376 transitions. [2024-11-11 20:55:57,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 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-11 20:55:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 376 transitions. [2024-11-11 20:55:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:57,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:57,628 INFO L218 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] [2024-11-11 20:55:57,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:55:57,629 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:57,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash -209362921, now seen corresponding path program 1 times [2024-11-11 20:55:57,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639629783] [2024-11-11 20:55:57,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:55:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,737 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-11 20:55:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639629783] [2024-11-11 20:55:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639629783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:55:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805834662] [2024-11-11 20:55:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:55:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:55:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:55:57,742 INFO L87 Difference]: Start difference. First operand 286 states and 376 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 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-11 20:55:57,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:57,773 INFO L93 Difference]: Finished difference Result 568 states and 780 transitions. [2024-11-11 20:55:57,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:55:57,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 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 46 [2024-11-11 20:55:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:57,777 INFO L225 Difference]: With dead ends: 568 [2024-11-11 20:55:57,778 INFO L226 Difference]: Without dead ends: 290 [2024-11-11 20:55:57,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:55:57,781 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:57,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-11 20:55:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2024-11-11 20:55:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 221 states have (on average 1.262443438914027) internal successors, (279), 234 states have internal predecessors, (279), 44 states have call successors, (44), 29 states have call predecessors, (44), 24 states have return successors, (57), 39 states have call predecessors, (57), 39 states have call successors, (57) [2024-11-11 20:55:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 380 transitions. [2024-11-11 20:55:57,806 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 380 transitions. Word has length 46 [2024-11-11 20:55:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:57,807 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 380 transitions. [2024-11-11 20:55:57,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 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-11 20:55:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 380 transitions. [2024-11-11 20:55:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-11 20:55:57,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:57,809 INFO L218 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] [2024-11-11 20:55:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:55:57,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:57,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1898306663, now seen corresponding path program 1 times [2024-11-11 20:55:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104543764] [2024-11-11 20:55:57,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:57,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:55:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:55:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:57,898 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-11 20:55:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:57,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104543764] [2024-11-11 20:55:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104543764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:57,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:57,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13638889] [2024-11-11 20:55:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:57,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:57,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:57,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:57,900 INFO L87 Difference]: Start difference. First operand 290 states and 380 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11 20:55:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:57,938 INFO L93 Difference]: Finished difference Result 726 states and 969 transitions. [2024-11-11 20:55:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:57,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 46 [2024-11-11 20:55:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:57,953 INFO L225 Difference]: With dead ends: 726 [2024-11-11 20:55:57,954 INFO L226 Difference]: Without dead ends: 417 [2024-11-11 20:55:57,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-11 20:55:57,957 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:57,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-11 20:55:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2024-11-11 20:55:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 320 states have (on average 1.240625) internal successors, (397), 336 states have internal predecessors, (397), 61 states have call successors, (61), 43 states have call predecessors, (61), 35 states have return successors, (75), 53 states have call predecessors, (75), 56 states have call successors, (75) [2024-11-11 20:55:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 533 transitions. [2024-11-11 20:55:57,998 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 533 transitions. Word has length 46 [2024-11-11 20:55:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:57,999 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 533 transitions. [2024-11-11 20:55:57,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-11 20:55:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 533 transitions. [2024-11-11 20:55:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 20:55:58,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,001 INFO L218 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] [2024-11-11 20:55:58,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:55:58,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1296933517, now seen corresponding path program 1 times [2024-11-11 20:55:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945160661] [2024-11-11 20:55:58,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:55:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:55:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:55:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,259 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-11 20:55:58,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945160661] [2024-11-11 20:55:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945160661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:55:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633975510] [2024-11-11 20:55:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:58,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:55:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:55:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:55:58,264 INFO L87 Difference]: Start difference. First operand 417 states and 533 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:58,636 INFO L93 Difference]: Finished difference Result 1374 states and 1883 transitions. [2024-11-11 20:55:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:55:58,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-11-11 20:55:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:58,644 INFO L225 Difference]: With dead ends: 1374 [2024-11-11 20:55:58,644 INFO L226 Difference]: Without dead ends: 1053 [2024-11-11 20:55:58,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:55:58,649 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 245 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:58,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 733 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:55:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-11 20:55:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1009. [2024-11-11 20:55:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 779 states have (on average 1.2246469833119384) internal successors, (954), 823 states have internal predecessors, (954), 142 states have call successors, (142), 93 states have call predecessors, (142), 87 states have return successors, (196), 125 states have call predecessors, (196), 130 states have call successors, (196) [2024-11-11 20:55:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1292 transitions. [2024-11-11 20:55:58,749 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1292 transitions. Word has length 50 [2024-11-11 20:55:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:58,751 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1292 transitions. [2024-11-11 20:55:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:55:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1292 transitions. [2024-11-11 20:55:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 20:55:58,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:58,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:55:58,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:55:58,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:58,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:58,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1580462347, now seen corresponding path program 1 times [2024-11-11 20:55:58,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887811775] [2024-11-11 20:55:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:55:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:55:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:55:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:55:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:55:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:55:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:55:58,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:58,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887811775] [2024-11-11 20:55:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887811775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:55:58,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114146338] [2024-11-11 20:55:58,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:58,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:55:58,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:58,960 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-11 20:55:58,963 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-11 20:55:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:59,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:55:59,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:55:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:59,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:55:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:55:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114146338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:55:59,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:55:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2024-11-11 20:55:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931477985] [2024-11-11 20:55:59,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:55:59,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:55:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:55:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:55:59,418 INFO L87 Difference]: Start difference. First operand 1009 states and 1292 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:56:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:00,428 INFO L93 Difference]: Finished difference Result 1907 states and 2556 transitions. [2024-11-11 20:56:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 20:56:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 81 [2024-11-11 20:56:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:00,436 INFO L225 Difference]: With dead ends: 1907 [2024-11-11 20:56:00,436 INFO L226 Difference]: Without dead ends: 916 [2024-11-11 20:56:00,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2024-11-11 20:56:00,445 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 291 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:00,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1527 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:56:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-11-11 20:56:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 821. [2024-11-11 20:56:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 630 states have (on average 1.211111111111111) internal successors, (763), 671 states have internal predecessors, (763), 106 states have call successors, (106), 86 states have call predecessors, (106), 84 states have return successors, (125), 93 states have call predecessors, (125), 104 states have call successors, (125) [2024-11-11 20:56:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 994 transitions. [2024-11-11 20:56:00,506 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 994 transitions. Word has length 81 [2024-11-11 20:56:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:00,507 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 994 transitions. [2024-11-11 20:56:00,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 5 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:56:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 994 transitions. [2024-11-11 20:56:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 20:56:00,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:00,513 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 20:56:00,532 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-11 20:56:00,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:00,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -158765002, now seen corresponding path program 1 times [2024-11-11 20:56:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:00,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680297714] [2024-11-11 20:56:00,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:00,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:56:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:56:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:56:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 20:56:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-11 20:56:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680297714] [2024-11-11 20:56:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680297714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260810098] [2024-11-11 20:56:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:00,833 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-11 20:56:00,835 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-11 20:56:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:00,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:56:00,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-11 20:56:00,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:56:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260810098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:00,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:56:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-11 20:56:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997599267] [2024-11-11 20:56:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:56:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:56:00,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:56:00,969 INFO L87 Difference]: Start difference. First operand 821 states and 994 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:56:01,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:01,003 INFO L93 Difference]: Finished difference Result 1005 states and 1227 transitions. [2024-11-11 20:56:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:56:01,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 150 [2024-11-11 20:56:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:01,005 INFO L225 Difference]: With dead ends: 1005 [2024-11-11 20:56:01,005 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:56:01,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:56:01,008 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:01,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:56:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:56:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:56:01,010 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-11 20:56:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:56:01,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2024-11-11 20:56:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:01,012 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:56:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:56:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:56:01,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:56:01,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:56:01,033 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-11 20:56:01,219 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,SelfDestructingSolverStorable9 [2024-11-11 20:56:01,222 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:01,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:56:04,800 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:56:04,864 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse6 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse3 (= 0 ~systemActive~0)) (.cse5 (= |old(~waterLevel~0)| 1)) (.cse4 (not .cse6)) (.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse7 (= |old(~waterLevel~0)| 2))) (and (or (< |old(~pumpRunning~0)| 1) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse0 .cse1)) (or (and .cse2 .cse0 .cse1) (not .cse3)) (or .cse4 (not .cse5) (and .cse2 (= ~waterLevel~0 1))) (or .cse0 (not (= 1 ~systemActive~0))) (or (and .cse6 .cse3) (and .cse6 .cse7) (and .cse5 .cse6) (<= 1 |old(~pumpRunning~0)|)) (or .cse4 (and .cse2 (= 2 ~waterLevel~0) .cse0) (not .cse7))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0))) (let ((.cse5 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse1 (= 0 ~systemActive~0)) (.cse3 (= |old(~waterLevel~0)| 1)) (.cse7 (not .cse0)) (.cse6 (= ~pumpRunning~0 0)) (.cse4 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse2 (= |old(~waterLevel~0)| 2))) (and (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse0) (< 0 |old(~pumpRunning~0)|)) (or (< |old(~pumpRunning~0)| 1) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse4 .cse5)) (or (and .cse6 .cse4 .cse5) (not .cse1)) (or .cse7 (not .cse3) (and .cse6 (= ~waterLevel~0 1))) (or .cse4 (not (= 1 ~systemActive~0))) (or .cse7 (and .cse6 (= 2 ~waterLevel~0) .cse4) (not .cse2)))))) [2024-11-11 20:56:04,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:56:04,890 WARN L156 FloydHoareUtils]: Requires clause for cleanup contained old-variable. Original clause: (let ((.cse6 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse3 (= 0 ~systemActive~0)) (.cse5 (= |old(~waterLevel~0)| 1)) (.cse4 (not .cse6)) (.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse7 (= |old(~waterLevel~0)| 2))) (and (or (< |old(~pumpRunning~0)| 1) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse0 .cse1)) (or (and .cse2 .cse0 .cse1) (not .cse3)) (or .cse4 (not .cse5) (and .cse2 (= ~waterLevel~0 1))) (or (and .cse6 .cse3) (and .cse6 .cse7) (and .cse5 .cse6) (<= 1 |old(~pumpRunning~0)|)) (or .cse4 (and .cse2 (= 2 ~waterLevel~0) .cse0) (not .cse7))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~switchedOnBeforeTS~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0))) (let ((.cse5 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse1 (= 0 ~systemActive~0)) (.cse3 (= |old(~waterLevel~0)| 1)) (.cse7 (not .cse0)) (.cse6 (= ~pumpRunning~0 0)) (.cse4 (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|)) (.cse2 (= |old(~waterLevel~0)| 2))) (and (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse0) (< 0 |old(~pumpRunning~0)|)) (or (< |old(~pumpRunning~0)| 1) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) .cse4 .cse5)) (or (and .cse6 .cse4 .cse5) (not .cse1)) (or .cse7 (not .cse3) (and .cse6 (= ~waterLevel~0 1))) (or .cse7 (and .cse6 (= 2 ~waterLevel~0) .cse4) (not .cse2)))))) [2024-11-11 20:56:04,893 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:56:04,897 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse3 (<= 1 ~pumpRunning~0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 (<= 1 ~switchedOnBeforeTS~0)) (and .cse0 (= |old(~waterLevel~0)| 1) .cse1) (and .cse3 .cse1 .cse2) (and .cse0 (= 0 ~systemActive~0))))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (= ~waterLevel~0 1)) (and .cse0 .cse2 (<= 1 ~switchedOnBeforeTS~0)) (and .cse3 .cse1 .cse2) (and .cse3 (= 0 ~systemActive~0)))) [2024-11-11 20:56:04,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:56:04 BoogieIcfgContainer [2024-11-11 20:56:04,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:56:04,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:56:04,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:56:04,911 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:56:04,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:55" (3/4) ... [2024-11-11 20:56:04,914 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:56:04,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:56:04,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:56:04,918 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:56:04,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:56:04,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:56:04,919 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-11 20:56:04,924 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:56:04,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:56:04,925 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:56:04,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:04,926 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:04,950 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(pumpRunning) < 1) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 1)) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive)) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((((\old(pumpRunning) == 0) && (0 == systemActive)) || ((\old(pumpRunning) == 0) && (\old(waterLevel) == 2))) || ((\old(waterLevel) == 1) && (\old(pumpRunning) == 0))) || (1 <= \old(pumpRunning)))) [2024-11-11 20:56:04,979 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(pumpRunning) < 1) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 1)) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive)) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((((\old(pumpRunning) == 0) && (0 == systemActive)) || ((\old(pumpRunning) == 0) && (\old(waterLevel) == 2))) || ((\old(waterLevel) == 1) && (\old(pumpRunning) == 0))) || (1 <= \old(pumpRunning)))) [2024-11-11 20:56:05,031 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:56:05,032 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:56:05,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:56:05,033 INFO L158 Benchmark]: Toolchain (without parser) took 10182.34ms. Allocated memory was 134.2MB in the beginning and 262.1MB in the end (delta: 127.9MB). Free memory was 62.8MB in the beginning and 173.4MB in the end (delta: -110.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,034 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:56:05,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.44ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 62.8MB in the beginning and 139.5MB in the end (delta: -76.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.08ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,035 INFO L158 Benchmark]: Boogie Preprocessor took 41.17ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,036 INFO L158 Benchmark]: RCFGBuilder took 406.99ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 118.3MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,036 INFO L158 Benchmark]: TraceAbstraction took 9051.12ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 117.3MB in the beginning and 180.7MB in the end (delta: -63.4MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,037 INFO L158 Benchmark]: Witness Printer took 121.01ms. Allocated memory is still 262.1MB. Free memory was 180.7MB in the beginning and 173.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:56:05,039 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.17ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.44ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 62.8MB in the beginning and 139.5MB in the end (delta: -76.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.08ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 137.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.17ms. Allocated memory is still 176.2MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.99ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 118.3MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9051.12ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 117.3MB in the beginning and 180.7MB in the end (delta: -63.4MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Witness Printer took 121.01ms. Allocated memory is still 262.1MB. Free memory was 180.7MB in the beginning and 173.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] - GenericResultAtLocation [Line: 164]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [164] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [530] - GenericResultAtLocation [Line: 565]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [565] - GenericResultAtLocation [Line: 633]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [633] - GenericResultAtLocation [Line: 732]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [732] - GenericResultAtLocation [Line: 907]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [907] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 4401 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3244 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1229 IncrementalHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 1157 mSDtfsCounter, 1229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 394 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1009occurred in iteration=8, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 151 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 1554 SizeOfPredicates, 2 NumberOfNonLiveVariables, 719 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 430/453 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: 576]: Location Invariant Derived location invariant: (((((pumpRunning == 0) && (2 == waterLevel)) || ((pumpRunning == 0) && (waterLevel == 1))) || ((pumpRunning == 0) && (0 == systemActive))) || ((1 <= pumpRunning) && (0 != systemActive))) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: ((((((\old(pumpRunning) < 1) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 1)) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) || ((pumpRunning == 0) && (2 == waterLevel))) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive)) || (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((((\old(pumpRunning) == 0) && (0 == systemActive)) || ((\old(pumpRunning) == 0) && (\old(waterLevel) == 2))) || ((\old(waterLevel) == 1) && (\old(pumpRunning) == 0))) || (1 <= \old(pumpRunning)))) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) - ProcedureContractResult [Line: 768]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 665]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 741]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((((((\old(pumpRunning) == 0) && (0 == systemActive)) || ((\old(pumpRunning) == 0) && (\old(waterLevel) == 2))) || ((\old(waterLevel) == 1) && (\old(pumpRunning) == 0))) || (0 < \old(pumpRunning))) && (((\old(pumpRunning) != 0) || (\old(waterLevel) != 1)) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)) || (\old(pumpRunning) < 1))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 61]: Procedure Contract for cleanup Derived contract for procedure cleanup. Ensures: ((((((\old(pumpRunning) == 0) && (0 == systemActive)) || ((\old(pumpRunning) == 0) && (\old(waterLevel) == 2))) || ((\old(waterLevel) == 1) && (\old(pumpRunning) == 0))) || ((1 <= \old(pumpRunning)) && (0 != systemActive))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 653]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: (((((2 == waterLevel) || (\old(waterLevel) != 1)) && (((((((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) == 2)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (\old(waterLevel) == 1)) && (1 == systemActive))) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2))) || ((pumpRunning == 0) && (0 == systemActive)))) && ((((2 == waterLevel) || (\old(waterLevel) < waterLevel)) && (waterLevel <= 2)) || (\old(waterLevel) == waterLevel))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 828]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: (((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1))) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) && (pumpRunning == \result)) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:56:05,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE