./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_spec1_product42.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 f8aef606697b9aeff574acbbe43b28a142b9105524bb5bbab5e1458056090146 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:18:13,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:18:13,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:18:13,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:18:13,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:18:13,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:18:13,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:18:13,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:18:13,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:18:13,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:18:13,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:18:13,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:18:13,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:18:13,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:18:13,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:18:13,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:18:13,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:18:13,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:18:13,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:18:13,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:18:13,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:18:13,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:18:13,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:18:13,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:18:13,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:18:13,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:18:13,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:18:13,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:18:13,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:18:13,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:18:13,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:18:13,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:18:13,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:18:13,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:18:13,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:18:13,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:18:13,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:18:13,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:18:13,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:18:13,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:18:13,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:18:13,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:18:13,422 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 -> f8aef606697b9aeff574acbbe43b28a142b9105524bb5bbab5e1458056090146 [2024-11-18 14:18:13,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:18:13,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:18:13,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:18:13,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:18:13,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:18:13,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2024-11-18 14:18:15,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:18:15,359 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:18:15,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2024-11-18 14:18:15,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed32c5ea/b026bb3f55994e0baa1d008d14e2dcec/FLAG3f006e041 [2024-11-18 14:18:15,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ed32c5ea/b026bb3f55994e0baa1d008d14e2dcec [2024-11-18 14:18:15,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:18:15,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:18:15,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:18:15,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:18:15,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:18:15,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d18dfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:15, skipping insertion in model container [2024-11-18 14:18:15,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:18:15" (1/1) ... [2024-11-18 14:18:15,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:18:16,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c[15994,16007] [2024-11-18 14:18:16,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:18:16,113 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:18:16,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-18 14:18:16,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] [2024-11-18 14:18:16,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [516] [2024-11-18 14:18:16,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [586] [2024-11-18 14:18:16,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [769] [2024-11-18 14:18:16,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [778] [2024-11-18 14:18:16,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [804] [2024-11-18 14:18:16,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] [2024-11-18 14:18:16,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c[15994,16007] [2024-11-18 14:18:16,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:18:16,197 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:18:16,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16 WrapperNode [2024-11-18 14:18:16,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:18:16,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:18:16,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:18:16,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:18:16,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,243 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 184 [2024-11-18 14:18:16,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:18:16,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:18:16,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:18:16,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:18:16,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,288 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-18 14:18:16,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:18:16,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:18:16,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:18:16,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:18:16,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (1/1) ... [2024-11-18 14:18:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:18:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:18:16,362 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-18 14:18:16,371 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-18 14:18:16,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:18:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:18:16,428 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:18:16,428 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:18:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:18:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:18:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:18:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-18 14:18:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-18 14:18:16,429 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:18:16,429 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:18:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:18:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:18:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:18:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:18:16,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:18:16,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:18:16,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:18:16,753 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-18 14:18:16,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:18:16,774 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:18:16,775 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:18:16,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16 BoogieIcfgContainer [2024-11-18 14:18:16,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:18:16,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:18:16,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:18:16,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:18:16,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:18:15" (1/3) ... [2024-11-18 14:18:16,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4badb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:18:16, skipping insertion in model container [2024-11-18 14:18:16,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:18:16" (2/3) ... [2024-11-18 14:18:16,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4badb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:18:16, skipping insertion in model container [2024-11-18 14:18:16,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16" (3/3) ... [2024-11-18 14:18:16,785 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product42.cil.c [2024-11-18 14:18:16,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:18:16,800 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:18:16,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:18:16,865 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;@6193f22b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:18:16,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:18:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 68 states have internal predecessors, (86), 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-18 14:18:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 14:18:16,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:16,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:16,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:16,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1535333319, now seen corresponding path program 1 times [2024-11-18 14:18:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:16,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095582217] [2024-11-18 14:18:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:17,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095582217] [2024-11-18 14:18:17,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095582217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:18:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468981070] [2024-11-18 14:18:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:18:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:18:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:18:17,172 INFO L87 Difference]: Start difference. First operand has 80 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 68 states have internal predecessors, (86), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,213 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2024-11-18 14:18:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:18:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-18 14:18:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,222 INFO L225 Difference]: With dead ends: 152 [2024-11-18 14:18:17,223 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 14:18:17,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:18:17,232 INFO L432 NwaCegarLoop]: 100 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, 100 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-18 14:18:17,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 14:18:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 14:18:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.309090909090909) internal successors, (72), 60 states have internal predecessors, (72), 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-18 14:18:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-11-18 14:18:17,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 23 [2024-11-18 14:18:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,285 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-11-18 14:18:17,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-18 14:18:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 14:18:17,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:18:17,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1879035650, now seen corresponding path program 1 times [2024-11-18 14:18:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123763242] [2024-11-18 14:18:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123763242] [2024-11-18 14:18:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123763242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195945204] [2024-11-18 14:18:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,441 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,464 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2024-11-18 14:18:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-18 14:18:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,468 INFO L225 Difference]: With dead ends: 107 [2024-11-18 14:18:17,469 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 14:18:17,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,472 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 14:18:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 14:18:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:18:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-18 14:18:17,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 24 [2024-11-18 14:18:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,488 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-18 14:18:17,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-18 14:18:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 14:18:17,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:18:17,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -110528575, now seen corresponding path program 1 times [2024-11-18 14:18:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279506455] [2024-11-18 14:18:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279506455] [2024-11-18 14:18:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279506455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330492923] [2024-11-18 14:18:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:17,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:17,669 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,730 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2024-11-18 14:18:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-18 14:18:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,733 INFO L225 Difference]: With dead ends: 117 [2024-11-18 14:18:17,734 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 14:18:17,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:18:17,736 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 223 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 14:18:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 14:18:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:18:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-11-18 14:18:17,750 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 29 [2024-11-18 14:18:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-11-18 14:18:17,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:18:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-11-18 14:18:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 14:18:17,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:18:17,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1402592638, now seen corresponding path program 1 times [2024-11-18 14:18:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79743132] [2024-11-18 14:18:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:17,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79743132] [2024-11-18 14:18:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79743132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968680261] [2024-11-18 14:18:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,816 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:17,861 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2024-11-18 14:18:17,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-18 14:18:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:17,863 INFO L225 Difference]: With dead ends: 157 [2024-11-18 14:18:17,863 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 14:18:17,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:17,866 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 67 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:17,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 14:18:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-18 14:18:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.294871794871795) internal successors, (101), 85 states have internal predecessors, (101), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2024-11-18 14:18:17,893 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 34 [2024-11-18 14:18:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:17,894 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2024-11-18 14:18:17,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2024-11-18 14:18:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 14:18:17,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:17,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:17,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:18:17,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -741551432, now seen corresponding path program 1 times [2024-11-18 14:18:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500113776] [2024-11-18 14:18:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500113776] [2024-11-18 14:18:18,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500113776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:18:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210584023] [2024-11-18 14:18:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:18:18,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:18:18,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:18:18,057 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,108 INFO L93 Difference]: Finished difference Result 195 states and 250 transitions. [2024-11-18 14:18:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:18:18,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-18 14:18:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,110 INFO L225 Difference]: With dead ends: 195 [2024-11-18 14:18:18,110 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 14:18:18,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:18:18,111 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:18,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 14:18:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 14:18:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.2875) internal successors, (103), 87 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2024-11-18 14:18:18,128 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 40 [2024-11-18 14:18:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,129 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2024-11-18 14:18:18,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2024-11-18 14:18:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 14:18:18,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:18:18,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1252593274, now seen corresponding path program 1 times [2024-11-18 14:18:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913566680] [2024-11-18 14:18:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:18:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913566680] [2024-11-18 14:18:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913566680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23913931] [2024-11-18 14:18:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:18,225 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,317 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2024-11-18 14:18:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-18 14:18:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,323 INFO L225 Difference]: With dead ends: 104 [2024-11-18 14:18:18,323 INFO L226 Difference]: Without dead ends: 102 [2024-11-18 14:18:18,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:18:18,324 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:18,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 287 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:18:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-18 14:18:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-18 14:18:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.275) internal successors, (102), 87 states have internal predecessors, (102), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2024-11-18 14:18:18,370 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 40 [2024-11-18 14:18:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,371 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-11-18 14:18:18,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2024-11-18 14:18:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 14:18:18,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:18:18,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1802322569, now seen corresponding path program 1 times [2024-11-18 14:18:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157174481] [2024-11-18 14:18:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,462 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-18 14:18:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157174481] [2024-11-18 14:18:18,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157174481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:18,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:18:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597833997] [2024-11-18 14:18:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:18:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:18:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:18,464 INFO L87 Difference]: Start difference. First operand 102 states and 126 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,496 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2024-11-18 14:18:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:18:18,496 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-18 14:18:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,498 INFO L225 Difference]: With dead ends: 200 [2024-11-18 14:18:18,498 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 14:18:18,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:18:18,501 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 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-18 14:18:18,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 14:18:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-18 14:18:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 90 states have internal predecessors, (105), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-18 14:18:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2024-11-18 14:18:18,512 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 46 [2024-11-18 14:18:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2024-11-18 14:18:18,513 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2024-11-18 14:18:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-18 14:18:18,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,518 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:18:18,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1730348677, now seen corresponding path program 1 times [2024-11-18 14:18:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592224889] [2024-11-18 14:18:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,590 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-18 14:18:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592224889] [2024-11-18 14:18:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592224889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:18:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100179070] [2024-11-18 14:18:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:18:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:18:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:18:18,593 INFO L87 Difference]: Start difference. First operand 105 states and 129 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,614 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2024-11-18 14:18:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:18:18,615 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), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-18 14:18:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,616 INFO L225 Difference]: With dead ends: 245 [2024-11-18 14:18:18,616 INFO L226 Difference]: Without dead ends: 147 [2024-11-18 14:18:18,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 14:18:18,617 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:18,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 143 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:18:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-18 14:18:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-18 14:18:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 124 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-18 14:18:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2024-11-18 14:18:18,638 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 46 [2024-11-18 14:18:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2024-11-18 14:18:18,640 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), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:18:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2024-11-18 14:18:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-18 14:18:18,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:18,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:18:18,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -135080021, now seen corresponding path program 1 times [2024-11-18 14:18:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733284655] [2024-11-18 14:18:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:18,756 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-18 14:18:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733284655] [2024-11-18 14:18:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733284655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:18:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 14:18:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405425136] [2024-11-18 14:18:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 14:18:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 14:18:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:18:18,759 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:18:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:18,950 INFO L93 Difference]: Finished difference Result 416 states and 523 transitions. [2024-11-18 14:18:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 14:18:18,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-18 14:18:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:18,956 INFO L225 Difference]: With dead ends: 416 [2024-11-18 14:18:18,956 INFO L226 Difference]: Without dead ends: 276 [2024-11-18 14:18:18,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-18 14:18:18,958 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:18,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 490 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:18:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-18 14:18:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-18 14:18:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 215 states have (on average 1.2232558139534884) internal successors, (263), 228 states have internal predecessors, (263), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (40), 30 states have call predecessors, (40), 32 states have call successors, (40) [2024-11-18 14:18:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 335 transitions. [2024-11-18 14:18:18,988 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 335 transitions. Word has length 50 [2024-11-18 14:18:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:18,989 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 335 transitions. [2024-11-18 14:18:18,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 14:18:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 335 transitions. [2024-11-18 14:18:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-18 14:18:18,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:18,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:18:18,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:18:18,992 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:18,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash 285012848, now seen corresponding path program 1 times [2024-11-18 14:18:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802339337] [2024-11-18 14:18:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 14:18:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:18:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802339337] [2024-11-18 14:18:19,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802339337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:18:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993668290] [2024-11-18 14:18:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:19,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:18:19,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:18:19,188 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-18 14:18:19,190 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-18 14:18:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:18:19,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:18:19,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:18:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 14:18:19,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:18:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993668290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:18:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:18:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-18 14:18:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350304412] [2024-11-18 14:18:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:18:19,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:18:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:18:19,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:18:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:18:19,474 INFO L87 Difference]: Start difference. First operand 276 states and 335 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:18:19,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:18:19,568 INFO L93 Difference]: Finished difference Result 545 states and 663 transitions. [2024-11-18 14:18:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:18:19,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-11-18 14:18:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:18:19,570 INFO L225 Difference]: With dead ends: 545 [2024-11-18 14:18:19,571 INFO L226 Difference]: Without dead ends: 276 [2024-11-18 14:18:19,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:18:19,572 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 45 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:18:19,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 519 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:18:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-18 14:18:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-18 14:18:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 215 states have (on average 1.2046511627906977) internal successors, (259), 228 states have internal predecessors, (259), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (35), 30 states have call predecessors, (35), 32 states have call successors, (35) [2024-11-18 14:18:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 326 transitions. [2024-11-18 14:18:19,590 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 326 transitions. Word has length 87 [2024-11-18 14:18:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:18:19,590 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 326 transitions. [2024-11-18 14:18:19,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:18:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 326 transitions. [2024-11-18 14:18:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-18 14:18:19,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:18:19,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:19,610 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-18 14:18:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 14:18:19,793 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:18:19,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:18:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -159739820, now seen corresponding path program 1 times [2024-11-18 14:18:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:18:19,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963995425] [2024-11-18 14:18:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:18:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:18:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:18:19,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:18:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:18:19,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:18:19,851 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:18:19,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:18:19,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:18:19,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:18:19,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:18:19,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:18:19 BoogieIcfgContainer [2024-11-18 14:18:19,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:18:19,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:18:19,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:18:19,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:18:19,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:18:16" (3/4) ... [2024-11-18 14:18:19,939 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:18:20,023 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:18:20,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:18:20,024 INFO L158 Benchmark]: Toolchain (without parser) took 4339.44ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 92.1MB in the beginning and 87.9MB in the end (delta: 4.2MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,024 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:18:20,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.20ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 70.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.73ms. Allocated memory is still 151.0MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,025 INFO L158 Benchmark]: Boogie Preprocessor took 75.76ms. Allocated memory is still 151.0MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,025 INFO L158 Benchmark]: RCFGBuilder took 454.44ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 66.2MB in the beginning and 162.7MB in the end (delta: -96.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,025 INFO L158 Benchmark]: TraceAbstraction took 3159.95ms. Allocated memory is still 205.5MB. Free memory was 161.7MB in the beginning and 94.2MB in the end (delta: 67.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,025 INFO L158 Benchmark]: Witness Printer took 85.30ms. Allocated memory is still 205.5MB. Free memory was 94.2MB in the beginning and 87.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 14:18:20,031 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.20ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 512.20ms. Allocated memory is still 151.0MB. Free memory was 91.7MB in the beginning and 70.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.73ms. Allocated memory is still 151.0MB. Free memory was 70.3MB in the beginning and 68.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.76ms. Allocated memory is still 151.0MB. Free memory was 68.2MB in the beginning and 66.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 454.44ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 66.2MB in the beginning and 162.7MB in the end (delta: -96.5MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3159.95ms. Allocated memory is still 205.5MB. Free memory was 161.7MB in the beginning and 94.2MB in the end (delta: 67.5MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Witness Printer took 85.30ms. Allocated memory is still 205.5MB. Free memory was 94.2MB in the beginning and 87.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] - GenericResultAtLocation [Line: 516]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [516] - GenericResultAtLocation [Line: 586]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [586] - GenericResultAtLocation [Line: 769]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [769] - GenericResultAtLocation [Line: 778]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [778] - GenericResultAtLocation [Line: 804]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [804] - GenericResultAtLocation [Line: 842]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [842] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 774]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L423] int waterLevel = 1; [L424] int methaneLevelCritical = 0; [L591] int pumpRunning = 0; [L592] int systemActive = 1; [L843] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] int retValue_acc ; [L917] int tmp ; [L921] FCALL select_helpers() [L922] FCALL select_features() [L923] CALL, EXPR valid_product() [L834] int retValue_acc ; [L837] retValue_acc = 1 [L838] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L923] RET, EXPR valid_product() [L923] tmp = valid_product() [L925] COND TRUE \read(tmp) [L927] FCALL setup() [L928] CALL runTest() [L910] CALL test() [L521] int splverifierCounter ; [L522] int tmp ; [L523] int tmp___0 ; [L524] int tmp___1 ; [L525] int tmp___2 ; [L528] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L530] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L532] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L538] tmp = __VERIFIER_nondet_int() [L540] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L542] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L441] COND TRUE waterLevel < 2 [L442] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L542] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L548] tmp___0 = __VERIFIER_nondet_int() [L550] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L558] tmp___2 = __VERIFIER_nondet_int() [L560] COND TRUE \read(tmp___2) [L562] CALL startSystem() [L765] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] RET startSystem() [L575] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L599] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L606] COND TRUE \read(systemActive) [L608] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND TRUE ! pumpRunning [L633] CALL, EXPR isHighWaterLevel() [L743] int retValue_acc ; [L744] int tmp ; [L745] int tmp___0 ; [L749] CALL, EXPR isHighWaterSensorDry() [L503] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L506] COND FALSE !(waterLevel < 2) [L510] retValue_acc = 0 [L511] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L749] RET, EXPR isHighWaterSensorDry() [L749] tmp = isHighWaterSensorDry() [L751] COND FALSE !(\read(tmp)) [L754] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L756] retValue_acc = tmp___0 [L757] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L633] RET, EXPR isHighWaterLevel() [L633] tmp = isHighWaterLevel() [L635] COND TRUE \read(tmp) [L637] CALL activatePump() [L662] int tmp ; [L666] CALL, EXPR isMethaneAlarm() [L687] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L691] retValue_acc = isMethaneLevelCritical() [L693] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L666] RET, EXPR isMethaneAlarm() [L666] tmp = isMethaneAlarm() [L668] COND FALSE !(\read(tmp)) [L672] CALL activatePump__wrappee__highWaterSensor() [L656] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L672] RET activatePump__wrappee__highWaterSensor() [L637] RET activatePump() [L608] RET processEnvironment() [L614] CALL __utac_acc__Specification1_spec__1() [L780] int tmp ; [L781] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L785] tmp = isMethaneLevelCritical() [L787] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L614] RET __utac_acc__Specification1_spec__1() [L575] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L530] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L532] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L538] tmp = __VERIFIER_nondet_int() [L540] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L548] tmp___0 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L552] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L453] COND FALSE !(\read(methaneLevelCritical)) [L456] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L552] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L558] tmp___2 = __VERIFIER_nondet_int() [L560] COND TRUE \read(tmp___2) [L562] CALL startSystem() [L765] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L562] RET startSystem() [L575] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L599] COND TRUE \read(pumpRunning) [L601] CALL lowerWaterLevel() [L429] COND TRUE waterLevel > 0 [L430] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L601] RET lowerWaterLevel() [L606] COND TRUE \read(systemActive) [L608] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L631] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L646] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L608] RET processEnvironment() [L614] CALL __utac_acc__Specification1_spec__1() [L780] int tmp ; [L781] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L462] int retValue_acc ; [L465] retValue_acc = methaneLevelCritical [L466] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L785] tmp = isMethaneLevelCritical() [L787] COND TRUE \read(tmp) [L789] CALL, EXPR isPumpRunning() [L698] int retValue_acc ; [L701] retValue_acc = pumpRunning [L702] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L789] RET, EXPR isPumpRunning() [L789] tmp___0 = isPumpRunning() [L791] COND TRUE \read(tmp___0) [L793] CALL __automaton_fail() [L774] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 2691 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1838 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 853 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=9, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 65/71 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 14:18:20,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE