./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_spec4_product33.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 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:54:28,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:54:28,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:54:28,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:54:28,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:54:28,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:54:28,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:54:28,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:54:28,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:54:28,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:54:28,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:54:28,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:54:28,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:54:28,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:54:28,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:54:28,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:54:28,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:54:28,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:54:28,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:54:28,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:54:28,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:54:28,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:54:28,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:54:28,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:54:28,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:54:28,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:54:28,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:54:28,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:54:28,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:54:28,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:54:28,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:54:28,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:54:28,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:54:28,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:54:28,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:54:28,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:54:28,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:54:28,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:54:28,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:54:28,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:54:28,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:54:28,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:54:28,518 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 -> 5399744cbc243992ccbbf21bf0e09dd5dced55fce1050770392b2964c31c4145 [2024-11-16 07:54:28,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:54:28,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:54:28,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:54:28,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:54:28,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:54:28,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-11-16 07:54:30,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:54:30,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:54:30,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2024-11-16 07:54:30,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc55a002/467bd1940116401288466c568e9d2706/FLAG2290cb918 [2024-11-16 07:54:30,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddc55a002/467bd1940116401288466c568e9d2706 [2024-11-16 07:54:30,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:54:30,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:54:30,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:54:30,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:54:30,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:54:30,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:54:30" (1/1) ... [2024-11-16 07:54:30,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538696cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:30, skipping insertion in model container [2024-11-16 07:54:30,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:54:30" (1/1) ... [2024-11-16 07:54:30,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:54:31,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c[17260,17273] [2024-11-16 07:54:31,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:54:31,214 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:54:31,223 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-16 07:54:31,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [415] [2024-11-16 07:54:31,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] [2024-11-16 07:54:31,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] [2024-11-16 07:54:31,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] [2024-11-16 07:54:31,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] [2024-11-16 07:54:31,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] [2024-11-16 07:54:31,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] [2024-11-16 07:54:31,284 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c[17260,17273] [2024-11-16 07:54:31,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:54:31,305 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:54:31,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31 WrapperNode [2024-11-16 07:54:31,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:54:31,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:54:31,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:54:31,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:54:31,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,347 INFO L138 Inliner]: procedures = 52, calls = 93, calls flagged for inlining = 21, calls inlined = 17, statements flattened = 169 [2024-11-16 07:54:31,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:54:31,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:54:31,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:54:31,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:54:31,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,385 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-16 07:54:31,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:54:31,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:54:31,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:54:31,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:54:31,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (1/1) ... [2024-11-16 07:54:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:54:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:54:31,442 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-16 07:54:31,446 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-16 07:54:31,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:54:31,492 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-16 07:54:31,492 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-16 07:54:31,492 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-16 07:54:31,492 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-16 07:54:31,492 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-16 07:54:31,492 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-16 07:54:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-16 07:54:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-16 07:54:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:54:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-16 07:54:31,493 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-16 07:54:31,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:54:31,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:54:31,567 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:54:31,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:54:31,713 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L816-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; [2024-11-16 07:54:31,714 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2024-11-16 07:54:31,714 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; [2024-11-16 07:54:31,714 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L871-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2024-11-16 07:54:31,793 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L551-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2024-11-16 07:54:31,794 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-1: main_#res#1 := main_~retValue_acc~3#1; [2024-11-16 07:54:31,818 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-16 07:54:31,818 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:54:31,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:54:31,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:54:31,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:54:31 BoogieIcfgContainer [2024-11-16 07:54:31,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:54:31,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:54:31,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:54:31,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:54:31,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:54:30" (1/3) ... [2024-11-16 07:54:31,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a051709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:54:31, skipping insertion in model container [2024-11-16 07:54:31,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:54:31" (2/3) ... [2024-11-16 07:54:31,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a051709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:54:31, skipping insertion in model container [2024-11-16 07:54:31,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:54:31" (3/3) ... [2024-11-16 07:54:31,850 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product33.cil.c [2024-11-16 07:54:31,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:54:31,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:54:31,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:54:31,937 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;@5882b355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:54:31,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:54:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 07:54:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 07:54:31,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:31,947 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] [2024-11-16 07:54:31,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:31,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:31,952 INFO L85 PathProgramCache]: Analyzing trace with hash -224490672, now seen corresponding path program 1 times [2024-11-16 07:54:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:31,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167753318] [2024-11-16 07:54:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,134 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-16 07:54:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167753318] [2024-11-16 07:54:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167753318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:32,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:54:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216490914] [2024-11-16 07:54:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:32,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:54:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:54:32,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 07:54:32,161 INFO L87 Difference]: Start difference. First operand has 76 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:32,184 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2024-11-16 07:54:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:54:32,187 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-16 07:54:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:32,194 INFO L225 Difference]: With dead ends: 143 [2024-11-16 07:54:32,194 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 07:54:32,197 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-16 07:54:32,200 INFO L432 NwaCegarLoop]: 93 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, 93 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-16 07:54:32,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 07:54:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-16 07:54:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 07:54:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-11-16 07:54:32,258 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 21 [2024-11-16 07:54:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:32,259 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-11-16 07:54:32,259 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-16 07:54:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 07:54:32,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:32,263 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-16 07:54:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:54:32,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:32,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1561155009, now seen corresponding path program 1 times [2024-11-16 07:54:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188163143] [2024-11-16 07:54:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,419 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-16 07:54:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:32,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188163143] [2024-11-16 07:54:32,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188163143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:32,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:32,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:54:32,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308374418] [2024-11-16 07:54:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:32,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:54:32,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:54:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:54:32,426 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:32,446 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2024-11-16 07:54:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:54:32,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-16 07:54:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:32,448 INFO L225 Difference]: With dead ends: 93 [2024-11-16 07:54:32,448 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 07:54:32,449 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-16 07:54:32,450 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 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-16 07:54:32,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 07:54:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 07:54:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 07:54:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-11-16 07:54:32,461 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 24 [2024-11-16 07:54:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:32,461 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-11-16 07:54:32,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-11-16 07:54:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 07:54:32,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:32,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:32,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:54:32,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:32,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -612584509, now seen corresponding path program 1 times [2024-11-16 07:54:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855372284] [2024-11-16 07:54:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,588 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-16 07:54:32,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855372284] [2024-11-16 07:54:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855372284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:32,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:32,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:54:32,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588350102] [2024-11-16 07:54:32,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:32,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:54:32,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:54:32,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:54:32,591 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:32,606 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-11-16 07:54:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:54:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-16 07:54:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:32,608 INFO L225 Difference]: With dead ends: 101 [2024-11-16 07:54:32,609 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 07:54:32,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 07:54:32,614 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 67 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-16 07:54:32,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 07:54:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 07:54:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-16 07:54:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-11-16 07:54:32,623 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 26 [2024-11-16 07:54:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:32,624 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-11-16 07:54:32,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-11-16 07:54:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 07:54:32,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:32,626 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] [2024-11-16 07:54:32,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 07:54:32,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:32,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1719940104, now seen corresponding path program 1 times [2024-11-16 07:54:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935230269] [2024-11-16 07:54:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:54:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:54:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935230269] [2024-11-16 07:54:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935230269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 07:54:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454837701] [2024-11-16 07:54:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:54:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:54:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:54:32,711 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:54:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:32,753 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2024-11-16 07:54:32,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:54:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-16 07:54:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:32,755 INFO L225 Difference]: With dead ends: 137 [2024-11-16 07:54:32,755 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 07:54:32,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:54:32,757 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 57 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 123 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-16 07:54:32,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 123 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 07:54:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-16 07:54:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 76 states have internal predecessors, (92), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 07:54:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2024-11-16 07:54:32,787 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 31 [2024-11-16 07:54:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:32,787 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2024-11-16 07:54:32,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:54:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2024-11-16 07:54:32,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 07:54:32,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:32,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:32,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:54:32,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:32,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:32,789 INFO L85 PathProgramCache]: Analyzing trace with hash -915928482, now seen corresponding path program 1 times [2024-11-16 07:54:32,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:32,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646375787] [2024-11-16 07:54:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:32,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:32,901 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-16 07:54:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:32,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646375787] [2024-11-16 07:54:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646375787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:32,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:54:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974356318] [2024-11-16 07:54:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:32,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:54:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:54:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:54:32,906 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:32,955 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2024-11-16 07:54:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:54:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-16 07:54:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:32,961 INFO L225 Difference]: With dead ends: 170 [2024-11-16 07:54:32,961 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 07:54:32,962 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-16 07:54:32,962 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 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-16 07:54:32,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 07:54:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-16 07:54:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 79 states have internal predecessors, (95), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 07:54:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2024-11-16 07:54:32,982 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 35 [2024-11-16 07:54:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:32,983 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2024-11-16 07:54:32,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2024-11-16 07:54:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 07:54:32,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:32,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 07:54:32,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1209331489, now seen corresponding path program 1 times [2024-11-16 07:54:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111019718] [2024-11-16 07:54:32,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,106 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-16 07:54:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111019718] [2024-11-16 07:54:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111019718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:33,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:54:33,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456877625] [2024-11-16 07:54:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:54:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:54:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:54:33,109 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:33,160 INFO L93 Difference]: Finished difference Result 175 states and 226 transitions. [2024-11-16 07:54:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:54:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-16 07:54:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:33,164 INFO L225 Difference]: With dead ends: 175 [2024-11-16 07:54:33,164 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 07:54:33,165 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-16 07:54:33,166 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 52 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:33,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 189 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 07:54:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-16 07:54:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 81 states have internal predecessors, (97), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 07:54:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-11-16 07:54:33,184 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 35 [2024-11-16 07:54:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:33,185 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-11-16 07:54:33,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-11-16 07:54:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 07:54:33,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:33,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:33,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:54:33,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:33,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1805772129, now seen corresponding path program 1 times [2024-11-16 07:54:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568458269] [2024-11-16 07:54:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,293 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-16 07:54:33,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:33,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568458269] [2024-11-16 07:54:33,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568458269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:33,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:33,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 07:54:33,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858838971] [2024-11-16 07:54:33,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:33,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:54:33,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:54:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 07:54:33,297 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:33,327 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2024-11-16 07:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:54:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-16 07:54:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:33,330 INFO L225 Difference]: With dead ends: 218 [2024-11-16 07:54:33,331 INFO L226 Difference]: Without dead ends: 133 [2024-11-16 07:54:33,331 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-16 07:54:33,332 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:33,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-16 07:54:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-16 07:54:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 113 states have internal predecessors, (135), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-16 07:54:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-16 07:54:33,356 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 35 [2024-11-16 07:54:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:33,357 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-16 07:54:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 07:54:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-16 07:54:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 07:54:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:33,358 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] [2024-11-16 07:54:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:54:33,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1510663044, now seen corresponding path program 1 times [2024-11-16 07:54:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076582719] [2024-11-16 07:54:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:54:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,463 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-16 07:54:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076582719] [2024-11-16 07:54:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076582719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:54:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918987581] [2024-11-16 07:54:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:54:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:54:33,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:54:33,467 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:54:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:33,515 INFO L93 Difference]: Finished difference Result 251 states and 313 transitions. [2024-11-16 07:54:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:54:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-16 07:54:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:33,518 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:54:33,519 INFO L226 Difference]: Without dead ends: 128 [2024-11-16 07:54:33,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-16 07:54:33,520 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 19 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:33,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 241 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:54:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-16 07:54:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-16 07:54:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 111 states have internal predecessors, (131), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-16 07:54:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2024-11-16 07:54:33,537 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 37 [2024-11-16 07:54:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:33,537 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2024-11-16 07:54:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 07:54:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2024-11-16 07:54:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 07:54:33,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:33,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:54:33,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash -271285373, now seen corresponding path program 1 times [2024-11-16 07:54:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784746172] [2024-11-16 07:54:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:33,685 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-16 07:54:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:33,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784746172] [2024-11-16 07:54:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784746172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:54:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471078892] [2024-11-16 07:54:33,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:54:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:54:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:54:33,689 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (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-16 07:54:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:33,899 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2024-11-16 07:54:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:54:33,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-16 07:54:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:33,901 INFO L225 Difference]: With dead ends: 333 [2024-11-16 07:54:33,902 INFO L226 Difference]: Without dead ends: 248 [2024-11-16 07:54:33,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:54:33,904 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 81 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:33,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 385 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:54:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-16 07:54:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2024-11-16 07:54:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 200 states have (on average 1.23) internal successors, (246), 214 states have internal predecessors, (246), 22 states have call successors, (22), 19 states have call predecessors, (22), 22 states have return successors, (39), 21 states have call predecessors, (39), 22 states have call successors, (39) [2024-11-16 07:54:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2024-11-16 07:54:33,932 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 39 [2024-11-16 07:54:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:33,933 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2024-11-16 07:54:33,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (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-16 07:54:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2024-11-16 07:54:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 07:54:33,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:33,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:33,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:54:33,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:33,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:33,935 INFO L85 PathProgramCache]: Analyzing trace with hash -403129826, now seen corresponding path program 1 times [2024-11-16 07:54:33,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:33,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162997100] [2024-11-16 07:54:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:54:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,014 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-16 07:54:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162997100] [2024-11-16 07:54:34,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162997100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:54:34,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:54:34,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:54:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298257785] [2024-11-16 07:54:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:54:34,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:54:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:34,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:54:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:54:34,016 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:54:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:34,200 INFO L93 Difference]: Finished difference Result 251 states and 311 transitions. [2024-11-16 07:54:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:54:34,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-16 07:54:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:34,204 INFO L225 Difference]: With dead ends: 251 [2024-11-16 07:54:34,204 INFO L226 Difference]: Without dead ends: 248 [2024-11-16 07:54:34,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:54:34,208 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 100 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:34,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 268 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 07:54:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-16 07:54:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2024-11-16 07:54:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 200 states have (on average 1.22) internal successors, (244), 214 states have internal predecessors, (244), 22 states have call successors, (22), 19 states have call predecessors, (22), 22 states have return successors, (39), 21 states have call predecessors, (39), 22 states have call successors, (39) [2024-11-16 07:54:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2024-11-16 07:54:34,235 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 41 [2024-11-16 07:54:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:34,235 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2024-11-16 07:54:34,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 07:54:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2024-11-16 07:54:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 07:54:34,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:34,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 07:54:34,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash -95325064, now seen corresponding path program 1 times [2024-11-16 07:54:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:34,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226226858] [2024-11-16 07:54:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:54:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:54:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-16 07:54:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:54:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:54:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226226858] [2024-11-16 07:54:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226226858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:54:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598777689] [2024-11-16 07:54:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:54:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:54:34,411 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-16 07:54:34,412 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-16 07:54:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:54:34,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:54:34,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:54:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:54:34,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:54:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 07:54:34,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598777689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:54:34,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:54:34,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2024-11-16 07:54:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174157226] [2024-11-16 07:54:34,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:54:34,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:54:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:54:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:54:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:54:34,726 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:54:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:54:35,089 INFO L93 Difference]: Finished difference Result 562 states and 738 transitions. [2024-11-16 07:54:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 07:54:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2024-11-16 07:54:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:54:35,092 INFO L225 Difference]: With dead ends: 562 [2024-11-16 07:54:35,092 INFO L226 Difference]: Without dead ends: 360 [2024-11-16 07:54:35,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-16 07:54:35,095 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 203 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:54:35,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 409 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:54:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-16 07:54:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 331. [2024-11-16 07:54:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 268 states have (on average 1.2238805970149254) internal successors, (328), 287 states have internal predecessors, (328), 31 states have call successors, (31), 27 states have call predecessors, (31), 31 states have return successors, (58), 28 states have call predecessors, (58), 31 states have call successors, (58) [2024-11-16 07:54:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 417 transitions. [2024-11-16 07:54:35,135 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 417 transitions. Word has length 64 [2024-11-16 07:54:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:54:35,136 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 417 transitions. [2024-11-16 07:54:35,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 07:54:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 417 transitions. [2024-11-16 07:54:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 07:54:35,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:54:35,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-16 07:54:35,155 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-16 07:54:35,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 07:54:35,342 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:54:35,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:54:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -163639005, now seen corresponding path program 2 times [2024-11-16 07:54:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:54:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323541607] [2024-11-16 07:54:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:54:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:54:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:54:35,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:54:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:54:35,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:54:35,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:54:35,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:54:35,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 07:54:35,410 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:54:35,478 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:54:35,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:54:35 BoogieIcfgContainer [2024-11-16 07:54:35,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:54:35,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:54:35,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:54:35,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:54:35,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:54:31" (3/4) ... [2024-11-16 07:54:35,486 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:54:35,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:54:35,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:54:35,564 INFO L158 Benchmark]: Toolchain (without parser) took 4765.12ms. Allocated memory was 130.0MB in the beginning and 197.1MB in the end (delta: 67.1MB). Free memory was 59.9MB in the beginning and 140.3MB in the end (delta: -80.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:54:35,565 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory was 89.0MB in the beginning and 88.8MB in the end (delta: 156.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.84ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 59.7MB in the beginning and 123.2MB in the end (delta: -63.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 163.6MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,566 INFO L158 Benchmark]: Boogie Preprocessor took 57.50ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,566 INFO L158 Benchmark]: IcfgBuilder took 432.04ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 101.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,566 INFO L158 Benchmark]: TraceAbstraction took 3640.39ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 146.6MB in the end (delta: -46.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:54:35,566 INFO L158 Benchmark]: Witness Printer took 82.14ms. Allocated memory is still 197.1MB. Free memory was 146.6MB in the beginning and 140.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 07:54:35,568 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.19ms. Allocated memory is still 130.0MB. Free memory was 89.0MB in the beginning and 88.8MB in the end (delta: 156.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.84ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 59.7MB in the beginning and 123.2MB in the end (delta: -63.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 163.6MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.50ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 432.04ms. Allocated memory is still 163.6MB. Free memory was 119.0MB in the beginning and 101.0MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3640.39ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 99.9MB in the beginning and 146.6MB in the end (delta: -46.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.14ms. Allocated memory is still 197.1MB. Free memory was 146.6MB in the beginning and 140.3MB 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,"Test.i","") [415] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [519] - GenericResultAtLocation [Line: 554]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [554] - GenericResultAtLocation [Line: 619]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [619] - GenericResultAtLocation [Line: 718]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [718] - GenericResultAtLocation [Line: 874]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [874] - GenericResultAtLocation [Line: 883]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [883] * 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: 879]: 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; [L416] int cleanupTimeShifts = 4; [L625] int waterLevel = 1; [L626] int methaneLevelCritical = 0; [L722] int pumpRunning = 0; [L723] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L497] int retValue_acc ; [L498] int tmp ; [L502] FCALL select_helpers() [L503] FCALL select_features() [L504] CALL, EXPR valid_product() [L546] int retValue_acc ; [L549] retValue_acc = 1 [L550] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L504] RET, EXPR valid_product() [L504] tmp = valid_product() [L506] COND TRUE \read(tmp) [L508] FCALL setup() [L509] CALL runTest() [L488] CALL test() [L556] int splverifierCounter ; [L557] int tmp ; [L558] int tmp___0 ; [L559] int tmp___1 ; [L560] int tmp___2 ; [L563] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L577] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L643] COND TRUE waterLevel < 2 [L644] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L577] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L730] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L762] COND TRUE ! pumpRunning [L764] CALL, EXPR isHighWaterLevel() [L856] int retValue_acc ; [L857] int tmp ; [L858] int tmp___0 ; [L862] CALL, EXPR isHighWaterSensorDry() [L705] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L708] COND FALSE !(waterLevel < 2) [L712] retValue_acc = 0 [L713] 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] [L862] RET, EXPR isHighWaterSensorDry() [L862] tmp = isHighWaterSensorDry() [L864] COND FALSE !(\read(tmp)) [L867] 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] [L869] retValue_acc = tmp___0 [L870] 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] [L764] RET, EXPR isHighWaterLevel() [L764] tmp = isHighWaterLevel() [L766] COND TRUE \read(tmp) [L768] CALL activatePump() [L787] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L768] RET activatePump() [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L745] RET __utac_acc__Specification4_spec__1() [L608] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L565] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L567] COND TRUE splverifierCounter < 4 [L573] tmp = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L583] tmp___0 = __VERIFIER_nondet_int() [L585] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L593] tmp___2 = __VERIFIER_nondet_int() [L595] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L608] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L730] COND TRUE \read(pumpRunning) [L732] CALL lowerWaterLevel() [L631] COND TRUE waterLevel > 0 [L632] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L732] RET lowerWaterLevel() [L737] COND TRUE \read(systemActive) [L739] CALL processEnvironment() [L759] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L762] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L777] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L739] RET processEnvironment() [L745] CALL __utac_acc__Specification4_spec__1() [L885] int tmp ; [L886] int tmp___0 ; [L890] CALL, EXPR getWaterLevel() [L696] int retValue_acc ; [L699] retValue_acc = waterLevel [L700] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L890] RET, EXPR getWaterLevel() [L890] tmp = getWaterLevel() [L892] COND TRUE tmp == 0 [L894] CALL, EXPR isPumpRunning() [L811] int retValue_acc ; [L814] retValue_acc = pumpRunning [L815] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L894] RET, EXPR isPumpRunning() [L894] tmp___0 = isPumpRunning() [L896] COND TRUE \read(tmp___0) [L898] CALL __automaton_fail() [L879] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 2266 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1464 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 802 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 160 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=11, InterpolantAutomatonStates: 65, 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, 11 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 541 NumberOfCodeBlocks, 541 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 963 SizeOfPredicates, 2 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 38/51 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-16 07:54:35,598 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